Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi

The characteristic polynomial as a structure discriminator (CROSBI ID 77490)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Randić, Milan ; Muller, Wolfgang R. ; Knop, Jan V. ; Trinajstić, Nenad The characteristic polynomial as a structure discriminator // Journal of chemical information and computer sciences, 37 (1997), 6; 1072-1077-x

Podaci o odgovornosti

Randić, Milan ; Muller, Wolfgang R. ; Knop, Jan V. ; Trinajstić, Nenad

engleski

The characteristic polynomial as a structure discriminator

We investigate use of the characteristic polynomial for discrimination of graphs. Here we consider acyclic graphs (trees) only, and in particular we consider trees without bridging vertices because no isospectral trees in which both graphs are without bridging vertices have been hitherto reported. However, we found the smallest such isospectral frees when n = 15. When the maximal valence is limited to four, so that graphs correspond to molecules of organic chemistry, the smallest isospectral (nonbridging) trees have n = 19 vertices. The smallest pair of isospectral binary trees were found among trees having n = 26 vertices. By combining contraction of trees to proper trees (i.e., trees without bridging vertices) and subsequent pruning of proper trees one can in many cases determine if two trees are isomorphic or not from comparison of their characteristic polynomials.

molecules; enumeration; spectra; graphs; trees

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

37 (6)

1997.

1072-1077-x

objavljeno

0095-2338

Povezanost rada

Kemija

Indeksiranost