hrcak mascot   Srce   HID

Izlaganje sa skupa

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

Puni tekst: engleski, pdf (4 MB) str. 883-897 preuzimanja: 157* citiraj
APA 6th Edition
Nikolić, S., Trinajstić, N., Jurić, A., Mihalić, Z. i Krilov, G. (1996). Complexity of Some Interesting (Chemical) Graphs. Croatica Chemica Acta, 69 (3), 883-897. Preuzeto s https://hrcak.srce.hr/177119
MLA 8th Edition
Nikolić, Sonja, et al. "Complexity of Some Interesting (Chemical) Graphs." Croatica Chemica Acta, vol. 69, br. 3, 1996, str. 883-897. https://hrcak.srce.hr/177119. Citirano 28.02.2020.
Chicago 17th Edition
Nikolić, Sonja, Nenad Trinajstić, Albin Jurić, Zlatko Mihalić i Goran Krilov. "Complexity of Some Interesting (Chemical) Graphs." Croatica Chemica Acta 69, br. 3 (1996): 883-897. https://hrcak.srce.hr/177119
Harvard
Nikolić, S., et al. (1996). 'Complexity of Some Interesting (Chemical) Graphs', Croatica Chemica Acta, 69(3), str. 883-897. Preuzeto s: https://hrcak.srce.hr/177119 (Datum pristupa: 28.02.2020.)
Vancouver
Nikolić S, Trinajstić N, Jurić A, Mihalić Z, Krilov G. Complexity of Some Interesting (Chemical) Graphs. Croatica Chemica Acta [Internet]. 1996 [pristupljeno 28.02.2020.];69(3):883-897. Dostupno na: https://hrcak.srce.hr/177119
IEEE
S. Nikolić, N. Trinajstić, A. Jurić, Z. Mihalić i G. Krilov, "Complexity of Some Interesting (Chemical) Graphs", Croatica Chemica Acta, vol.69, br. 3, str. 883-897, 1996. [Online]. Dostupno na: https://hrcak.srce.hr/177119. [Citirano: 28.02.2020.]

Sažetak
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.

Hrčak ID: 177119

URI
https://hrcak.srce.hr/177119

Posjeta: 239 *