On the calculation of the terminal polynomial of a star-like graph ## AbstractThe terminal matrix is the distance matrix between all pairs of valence one vertices of a given graph and the terminal polynomial is the characteristic polynomial of the terminal matrix. Star-like graphs are connected graphs with at most one vertex of degree d ≥ 3. The recursive formula that calculates the terminal polynomial of a star-like graph is given. Particularly, the formula that calculates the constant term in the terminal polynomial is given in closed form.
[Edit] |