Which of the following statements is not true for isomorphic graphs?a.Number of vertices in both the graphs must be same.b.Number of edges in both the graphs must be same.c.They have n+1 connected componentsd.Degree sequence of both the graphs must be same.

Graph isomorphism is concerned with:A. The number of vertices and edgesB. The degrees of verticesC. The labeling of vertices and edgesD. The structural equivalence of graphs

or each of the classes Ci below determine the smallest n for which Cicontains nonisomorphic n-vertex graphs with the same degree sequence:(a) C1 = { all graphs }, (b) C2 = { loopless graphs }, (c) C3 = { simplegraphs }

4. Which of the following is true?(a) A graph may contain no edge and many vertices(b) A graph may contain no edges and no vertices(c) A graph may contain no edges and no vertices(d) A graph may contain no vertices and many edges

The subgraph-isomorphism problem takes two undirected graphs G1 and G2, andit asks whether G1 is isomorphic to a subgraph of G2. Show that the subgraph-isomorphism problem is NP-complete.

In a simple undirected graph, the minimum degree is 2 and the maximum degree is 5. Which of the following statements is true?a.The graph must have a vertex of degree 3b.The graph must have a vertex of degree 6c.The graph must have a vertex of degree 4d.The graph must have a vertex of degree 7