hrcak mascot   Srce   HID

Izvorni znanstveni članak

Importance and Redundancy in Fullerene Graphs

Tomislav Došlić   ORCID icon orcid.org/0000-0002-8326-513X ; Department of Informatics and Mathematics, Faculty of Agriculture, University of Zagreb, Svetošimunska c. 25, 10000 Zagreb, Croatia

Puni tekst: engleski, pdf (92 KB) str. 869-879 preuzimanja: 161* citiraj
APA 6th Edition
Došlić, T. (2002). Importance and Redundancy in Fullerene Graphs. Croatica Chemica Acta, 75 (4), 869-879. Preuzeto s https://hrcak.srce.hr/131741
MLA 8th Edition
Došlić, Tomislav. "Importance and Redundancy in Fullerene Graphs." Croatica Chemica Acta, vol. 75, br. 4, 2002, str. 869-879. https://hrcak.srce.hr/131741. Citirano 28.02.2021.
Chicago 17th Edition
Došlić, Tomislav. "Importance and Redundancy in Fullerene Graphs." Croatica Chemica Acta 75, br. 4 (2002): 869-879. https://hrcak.srce.hr/131741
Harvard
Došlić, T. (2002). 'Importance and Redundancy in Fullerene Graphs', Croatica Chemica Acta, 75(4), str. 869-879. Preuzeto s: https://hrcak.srce.hr/131741 (Datum pristupa: 28.02.2021.)
Vancouver
Došlić T. Importance and Redundancy in Fullerene Graphs. Croatica Chemica Acta [Internet]. 2002 [pristupljeno 28.02.2021.];75(4):869-879. Dostupno na: https://hrcak.srce.hr/131741
IEEE
T. Došlić, "Importance and Redundancy in Fullerene Graphs", Croatica Chemica Acta, vol.75, br. 4, str. 869-879, 2002. [Online]. Dostupno na: https://hrcak.srce.hr/131741. [Citirano: 28.02.2021.]

Sažetak
The concept of importance of an edge in a fullerene graph has been defined and lower bounds have been established for this quantity. These lower bounds are then used to obtain an improved lower bound on the number of perfect matchings in fullerene graphs.

Ključne riječi
fullerene graphs; fullerenes; perfect matchings; enumeration

Hrčak ID: 131741

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

Posjeta: 281 *