2 research outputs found
Path-tables of trees: a survey and some new results
The (vertex) path-table of a tree contains quantitative information about the paths in . The entry of this table gives the number of paths of length passing through vertex . The path-table is a slight variation of the notion of path layer matrix. In this survey we review some work done on the vertex path-table of a tree and also introduce the edge path-table. We show that in general, any type of path-table of a tree does not determine uniquely. We shall show that in trees, the number of paths passing through edge can only be expressed in terms of paths passing through vertices and up to a length of 4. In contrast to the vertex path-table, we show that the row of the edge path-table corresponding to the central edge of a tree of odd diameter, is unique in the table. Finally we show that special classes of trees such as caterpillars and restricted thin trees (RTT) are reconstructible from their path-tables