If a graph has n vertices and
To check:
Whether a graph, having
Given information:
Graph with
Concept used:
Any tree with
Calculation:
Claim: such a graph cannot be connected.
Reason: if possible suppose that the graph is connected then the graph or any of its sub graph with all the vertices can be a tree because a graph and all of its sub graph with