|
On the calculation of the terminal polynomial of a star-like graph
Boris Horvat
Croat. chem. acta
Volume 82,
Number 3,
,
2009.
ISSN 0011-1643
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. | EPrint Type: | Article |
|---|
| Project Keyword: | Project Keyword UNSPECIFIED |
|---|
| Subjects: | Theory & Algorithms |
|---|
| ID Code: | 8164 |
|---|
| Deposited By: | Boris Horvat |
|---|
| Deposited On: | 21 February 2012 |
|---|
[Edit]
| 