COMPLEXITY OF SOME INTERESTING (CHEMICAL) GRAPHS

Authors
NIKOLIC S TRINAJSTIC N JURIC A MIHALIC Z KRILOV G
Citation
S. Nikolic et al., COMPLEXITY OF SOME INTERESTING (CHEMICAL) GRAPHS, Croatica chemica acta, 69(3), 1996, pp. 883-897
Citations number
54
Categorie Soggetti
Chemistry
Journal title
Croatica chemica acta → ACNP
ISSN journal
00111643
Volume
69
Issue
3
Year of publication
1996
Pages
883 - 897
Database
ISI
SICI code
0011-1643(1996)69:3<883:COSI(G>2.0.ZU;2-0
Abstract
Complexity of some interesting polycyclic graphs is expressed in terms of the corresponding spanning trees. Graphs considered were a selecti on of all connected graphs with four and five vertices, graphs compose d of two parts, or more parts, connected by a single edge, the Peterse n graph, the Blanusa graph, the Desargues-Levy graph and the Schlegel graph of buckminsterfullerene.