On the calculation of the terminal polynomial of a star-like graph

Summary: 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 tha...

Full description

Permalink: http://skupni.nsk.hr/Record/nsk.NSK01000734933/Details
Matična publikacija: Croatica chemica acta
82 (2009), 3 ; str. 679-684
Glavni autor: Horvat, Boris, inženjer matematike (-)
Vrsta građe: Članak
Jezik: eng
Predmet:
Online pristup: Croatica Chemica Acta
LEADER 01357caa a2200265 ir4500
001 NSK01000734933
003 HR-ZaNSK
005 20170904122128.0
007 ta
008 100427s2009 ci ||| ||eng
035 |9 (HR-ZaNSK)737555 
035 |a (HR-ZaNSK)000734933 
040 |a HR-ZaNSK  |b hrv  |c HR-ZaNSK  |e ppiak 
042 |a croatica 
080 |a 54  |2 MRF 1998. 
100 1 |a Horvat, Boris,  |c inženjer matematike 
245 1 0 |a On the calculation of the terminal polynomial of a star-like graph /  |c Boris Horvat. 
300 |b Ilustr. 
504 |a Bibliografija: 12 jed 
520 8 |a Summary: 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 
653 0 |a Terminalni polinom  |a Zvjezdoliki graf  |a Terminalna matrica 
773 0 |t Croatica chemica acta  |x 0011-1643  |g 82 (2009), 3 ; str. 679-684  |w nsk.(HR-ZaNSK)000001621 
981 |b B02/09 
998 |a Luko100427  |c vol2o130307 
856 4 2 |u http://hrcak.srce.hr/cca  |y Croatica Chemica Acta