If a graph has n vertices and or fewer can it be connected? Why?
Whether a graph, having is connected or not.
Any tree with vertices has
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 vertices has edges fewer than
Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!Get Started