hy,
According to definition “A graph is said to be connected if there exist at least one path between every pair of vertices otherwise graph is said to be disconnected.”
https://en.wikipedia.org/wiki/Connectivity_(graph_theory)
“If The number of edges is supposed to be the shortest paths from v to all vertices of G.” But if its not so we can intrepret that either few vertices in G1 are connected (which means as a whole G1 is disconnected) or all vertices in G1 is connected (which means it forms a tree or a cyle (clique) )
If we assume G1 is connected(if there exist is at least one path between every pair of vertices),
Either:
- G1 forms a tree (Or) (option D)
- G1 forms a cycle which in turns a clique (option C)
I think we cant really assume anything.
But if “option B was: G1 atleast 1 connected edge”. it would be more apt. since
“option B was: G1 atleast 1 connected edge” : FALSE: The number of edges is supposed to be the shortest paths from v to all vertices of G
“option B was: G1 atleast 1 connected edge” : TRUE: The number of edges is not supposed to be the shortest paths from v to all vertices of G since the existence of Zero edge.
Please do correct me if i am wrong.