A directed graph G = (V, E) is said to be finite if its ________.

Related MCQs

• A path of a graph is said to be ______ if it contains all the edges of the graph.
• Let G be a directed graph whose vertex set is the set of numbers from 1 to 50. There is an edge from a vertex i to a vertex j if and only if either j = i + 1 or j = 3i. Calculate the minimum number of edges in a path in G from vertex 1 to vertex 50.
• A directed complete graph of n vertices contains __________.
• Berge graph is similar to              due to strong perfect graph theorem.
• G is a simple undirected graph and some vertices of G are of odd degree. Add a node n to G and make it adjacent to each odd degree vertex of G. The resultant graph is              
• Let G be an arbitrary graph with v nodes and k components. If a vertex is removed from G, the number of components in the resultant graph must necessarily lie down between            and            
• In a graph if few edges have directions and few do not have directions then the graph is called _________.
• If the graph G1 and G2 has no vertex in common then it is said to be ______.
• Two finite sets A and B have m and n elements respectively. If the total number of subsets of A is 112 more than the total number of subsets of B, then the value of m is
• In a              the vertex set and the edge set are finite sets.