All Pairs of Pentagons in Leapfrog Fullerenes Are Nice

Tomislav Došlić
Additional contact information
Tomislav Došlić: Faculty of Civil Engineering, University of Zagreb, Kačićeva 26, 10000 Zagreb, Croatia

Mathematics, 2020, vol. 8, issue 12, 1-7

Abstract: A subgraph H of a graph G with perfect matching is nice if G − V ( H ) has perfect matching. It is well-known that all fullerene graphs have perfect matchings and that all fullerene graphs contain some small connected graphs as nice subgraphs. In this contribution, we consider fullerene graphs arising from smaller fullerenes via the leapfrog transformation, and show that in such graphs, each pair of (necessarily disjoint) pentagons is nice. That answers in affirmative a question posed in a recent paper on nice pairs of odd cycles in fullerene graphs.

Keywords: perfect matching; nice subgraph; fullerene graph; leapfrog fullerene (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/8/12/2135/pdf (application/pdf)
https://www.mdpi.com/2227-7390/8/12/2135/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:8:y:2020:i:12:p:2135-:d:454298

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().