Computer Sciences > Gate 2017 Set-2 > Graph Theory
G is undirected graph with n vertices and 25 edges such that each vertex has degree at least 3. Then the maximum possible value of n is ________
Correct : a
Similar Questions
The number of spanning trees in a complete graph of 4 vertices labelled A, B, C, and D is
The number of spanning trees in a complete graph of 4 vertices labelled A, B, C, and D is
The number of spanning trees in a complete graph of 4 vertices labelled A, B, C, and D is
Total Unique Visitors
Loading......