Skip to the main content

Conference paper

Complexity of Some Interesting (Chemical) Graphs

Sonja Nikolić ; Rugjer Bošković Institute, P'O.Box 1016, Bijenička 54, 10001 Zagreb, The Republic of Croatia
Nenad Trinajstić ; Rugjer Bošković Institute, P'O.Box 1016, Bijenička 54, 10001 Zagreb, The Republic of Croatia
Albin Jurić ; Department of Chemistry, Agricultural Institute, 43260 Križevci, The Republic of Croatia
Zlatko Mihalić ; Faculty of Science and Mathematics, The University of Zagreb, 10001 Zagreb, The Republic of Croatia
Goran Krilov ; Drake University, Des Moines, Iowa 50311, USA


Full text: english pdf 4.495 Kb

page 883-897

downloads: 387

cite


Abstract

Complexity of some interesting polycyclic graphs is expressed in
terms of the corresponding spanning trees. Graphs considered were
a selection of all connected graphs with four and five vertices, graphs composed of two parts, or more parts, connected by a single edge, the Petersen graph, the Blanuša graph, the Desargues-Levy graph and the Schlegel graph of buckminsterfullerene.

Keywords

Hrčak ID:

177119

URI

https://hrcak.srce.hr/177119

Visits: 688 *