A graph which has the same number of edges as its complement must have

Back to the 2022 paper

Module 5: Graphs and Trees

20222m

A graph which has the same number of edges as its complement must have number of vertices congruent to ______ or ______ modulo 4 (for integral values of number of edges).

(i) $6k, 6k-1$
(ii) $4k, 4k+1$
(iii) $k, k+2$
(iv) $2k+1, k$

Search Google Ask AI

Similar questions

Discrete MathematicsThe number of edges in a regular graph of degree 46 and 8 vertices is (i) 347 (ii) 230 (iii) 184 (iv) 18620222m Discrete Mathematics(i) The number of edges in a bipartite graph with n vertices is at most (i) n^2/2 (ii) n^2/4 (iii) n^2 (iv) 2n20192m Discrete MathematicsAn undirected graph has 8 vertices labelled 1, 2, \dots, 8 and 31 edges. Vertices 1, 3, 5, 7 have degree 8 and vertices 2, 4, 6, 8 have degree 7. What is the degree of vertex 8? (i) 15 (ii) 8 (iii) 5 (iv) 2320222m Design and Analysis of Algorithms The minimum number of colors needed to color a graph having n > 3 vertices and 2 edges is (i) 2 (ii) 3 (iii) 4 (iv) 120222m

PreviousAn undirected graph has 8 vertices labelled 1, 2, \dots, 8 and 31 edges. Vertices 1, 3, 5, 7 have degree 8 and vertices 2, 4, 6, 8 have degree 7. What is the degree of vertex 8? (i) 15 (ii) 8 (iii) 5 (iv) 23 NextA graph which consists of disjoint union of trees is called (i) bipartite graph (ii) forest (iii) caterpillar tree (iv) labelled tree