A complete graph can have – McqOptions

MCQOPTIONS

1.	A complete graph can have
A.	N^2 spanning trees
B.	n^(n-2) spanning trees
C.	N^(n+1) spanning trees
D.	N^n spanning trees
Answer» C. N^(n+1) spanning trees

Discussion

No Comment Found

Related MCQs

A complete graph can have
A connected graph T without any cycles is called ..
A directed graph is . if there is a path from each vertex to every other vertex in the digraph.
A graph is a collection of nodes, called . And line segments called arcs or .. that connect pair of nodes.
A graph is said to be if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.
A .. is a graph that has weights of costs associated with its edges.
What would be the time complexity of the following function which adds an edge between two vertices i and j, with some weight weigh to the graph having V vertices?
For which type of graph, the given program would run infinitely? The Input would be in the form of an adjacency Matrix and n is its dimension (1
Given the following adjacency matrix of a graph(G) determine the number of components in the G. [0 1 1 0 0 0], [1 0 1 0 0 0], [1 1 0 0 0 0], [0 0 0 0 1 0], [0 0 0 1 0 0], [0 0 0 0 0 0].
If locality is a concern, you can use . to traverse the graph.