In: Advanced Math
Give an example of a graph G with p(G) = 7 and c(G) = 3.
p(G) denotes the number of vertices in a graph G.
c(G) denotes the number of connected components of graph G.
We have to find a graph such that number of vertices in a graph is 7 and number of connected components is 3.
Here I have given 3 such examples as follows.
1) Graph G with 7 vertices, 4 edges and 3 connected components. i.e. p(G) = 7 and c(G) = 3
Here one component is G1 with 2 vertices and one edge, Second component is G2 with 4 vertices and 3 edges and third component G3 is only a vertex v1.
2) Graph G with 7 vertices, 5 edges and 3 connected components. i.e. p(G) = 7 and c(G) = 3
Here one component is G1 with 3 vertices and 3 edges, Second component is G2 with 2 vertices and 2 edges and third component G3 with 2 vertices and 2 edges.
3) Graph G with 7 vertices, 5 edges and 3 connected components. i.e. p(G) = 7 and c(G) = 3
Here one component is G1 with a single vertex v1, Second component is G2 with also single vertex v2 and third component G3 with 5 vertices and 5 edges.