Prove that if G is a connected undirected graph with n vertices and n-1 edges, then G is a tree.
Subject Algorithm Design
NU Year Set: 3.(b) Marks: 4 Year: 2011
Login to post your comment.