Types of trees A path graph (or linear graph) consists of vertices arranged in a line, so that vertices and are connected by an edge for . A starlike tree consists of a central vertex called root and several path graphs attached to it. More formally, a tree is starlike if it has exactly one vertex of degree greater than 2. A star tree is a tree which consists of a single internal vertex (and leaves). In other words, a star tree of order is a tree of order with as many leaves as possible. A caterpillar tree is a tree in which all vertices are within distance 1 of a central path subgraph. A lobster tree is a tree in which all vertices are within distance 2 of a central path subgraph. A regular tree of degree is the infinite tree with edges at each vertex. These arise as the Cayley graphs of free groups, and in the theory of Tits buildings. In statistical mechanics they are known as Bethe lattices.
Types of trees A path graph (or linear grap.h) consists of vertices arranged in a line, so that vertices and are connected by an edge for . A starlike tree consists of a central vertex called root and several path graphs attache.d to it More formally, a tree is starlike if it has exactly one vertex of degree greater than 2 A star tree is a tree which consists of a single internal vertex (and leaves). In other words a star tree of order is a tree of order with as many leaves as possible. A caterpillar tree is a tree in which all vertices are within distance 1 of a central path subgraph. A lobster tree is a tree in which all vertices are within distance 2 of a central path subgraph. A regular tree of degree is the infinite tree wit,h edges at each vertex These arise as the Cayley graphs of free groups and in the theory of Tits buildings. In statistical mechanics they are known as Bethe lattices