Skoči na glavni sadržaj

Izvorni znanstveni članak

Importance and Redundancy in Fullerene Graphs

Tomislav Došlić orcid id 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: 252

citiraj


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: 445 *