ABSTRACT
Trees as graphs havemany applications, especially in data storage and communication. Agraphhavingno cycle isacyclic.A forest is an acyclic graph.A tree is a connected
acyclic graph. A leaf (or pendant vertex) is a vertex of degree 1. A spanning subgraph of G is a subgraph with vertex set V (G). A spanning tree is a spanning subgraph that is a tree.
