The minimum number of edges in a connected cyclic graph on n vertices is

Related MCQs

• What is the number of vertices in an undirected connected graph with 39 edges, 7 vertices of degree 2, 2 vertices of degree 5 and remaining of degree 6?
• A              is a graph which has the same number of edges as its complement must have number of vertices congruent to 4m or 4m modulo 4(for integral values of number of edges).
• The minimum number of edges in a connected graph with n vertices is ___________.
• If two edges have same vertices as its terminal vertices those edges are called ____.
• The 2n vertices of a graph G corresponds to all subsets of a set of size n, for n>=4. Two vertices of G are adjacent if and only if the corresponding sets intersect in exactly two elements. The number of connected components in G can be                        
• Any subset of edges that connects all the vertices and has minimum total weight, if all the edge weights of an undirected graph are positive is called                
•              is the maximum number of edges in an acyclic undirected graph with k vertices.
• The total number of edges in a complete graph of n vertices is _________.
• If G is the forest with 54 vertices and 17 connected components, G has                total number of edges.
• What is the grade of a planar graph consisting of 8 vertices and 15 edges?