Computer Sciences > Gate 2022 > Graph
Consider a simple undirected graph of 10 vertices. If the graph is disconnected, then the maximum number of edges it can have is ____________.

Correct : 36

Similar Questions

Let G = (V, G) be a weighted undirected graph and let T be a Minimum Spanning Tree (MST) of G maintained using adjacency lists. Suppose a new weighed edge (u, v...
#280 MCQ
Consider a simple undirected unweighted graph with at least three vertices. If A is the adjacency matrix of the graph, then the number of 3-cycles in the graph...
#314 MCQ
Suppose you look at a three-dimensional figure. Which of the following must necessarily be true?
#798 MCQ

Related Topics

graph theory GATE 2022 computer science GATE disconnected graph maximum edges simple undirected graph GATE computer sciences minimum spanning tree graph edge count GATE question 37

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: