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).

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?
• If two edges have same vertices as its terminal vertices those edges are called ____.
• B1: ({0, 1, 2….(n-1)}, xm) where xn stands for “multiplication-modulo-n” and B2: ({0, 1, 2….n}, xn) where xn stands for “multiplication-modulo-m” are the two statements. Both B1 and B2 are considered to be                      
• 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                        
• In a graph if few edges have directions and few do not have directions then the graph is called _________.
• 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 minimum number of edges in a connected cyclic graph on n vertices is
• The minimum number of edges in a connected graph with n vertices is ___________.
• The total number of edges in a complete graph of n vertices is _________.