It may be observed that if there are n vertices in a tree then there are exactly n - Since loops and parallel edges form simple circuits, no tree can have loops or edges. Thus, every tree is a simple graph. A graph having no simple circuit is alsoanbsp;...
|Title||:||Comprehensive Discrete Mathematics|
|Publisher||:||Laxmi Publications, Ltd. -|