Izvorni znanstveni članak

On the Calculation of the Terminal Polynomial of a Star-like Graph

Boris Horvat ; IMFM, University of Ljubljana, Jadranska 19, Ljubljana, Slovenia

Sažetak

The 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.

Ključne riječi

terminal polynomial; terminal polynomial theorem; star-like graph, Clarke Theorem

Hrčak ID:

45475

URI

https://hrcak.srce.hr/45475

Datum izdavanja:

11.12.2009.

Posjeta: 1.380 *