Question: Show by some (as many as possible) examples that a graph of order n and size n-1 need not be a tree.
Step by Step Solution
3.48 Rating (161 Votes )
There are 3 Steps involved in it
A tree is a connected graph with no cycles consisting of n vertices order n and n 1 edges size n1 Ho... View full answer
Get step-by-step solutions from verified subject matter experts
