2-extendability of (4,5,6)-fullerenes
Lifang Zhao, Heping Zhang

TL;DR
This paper characterizes which (4,5,6)-fullerenes are 2-extendable, identifying specific sporadic cases and classes, and reveals a link between non-2-extendability and the anti-Kekulé number.
Contribution
It completely classifies 2-extendability of (4,5,6)-fullerenes, including sporadic and class-based cases, and establishes new connections with anti-Kekulé numbers.
Findings
All non-2-extendable (4,5,6)-fullerenes are identified.
All (4,5,6)-fullerenes with anti-Kekulé number 3 are non-2-extendable.
Existence of non-2-extendable (4,5,6)-fullerenes with arbitrarily many vertices.
Abstract
A (4,5,6)-fullerene is a plane cubic graph whose faces are only quadrilaterals, pentagons and hexagons, which includes all (4,6)- and (5,6)-fullerenes. A connected graph with at least vertices is -extendable if has perfect matchings and any matching of size is contained in a perfect matching of . We know that each (4,5,6)-fullerene graph is 1-extendable and at most 2-extendable. It is natural to wonder which (4,5,6)-fullerene graphs are 2-extendable. In this paper, we completely solve this problem (see Theorem 3.3): All non-2-extendable (4,5,6)-fullerenes consist of four sporadic (4,5,6)-fullerenes ( and ) and five classes of (4,5,6)-fullerenes. As a surprising consequence, we find that all (4,5,6)-fullerenes with the anti-Kekul\'{e} number 3 are non-2-extendable. Further, there also always exists a non-2-extendable…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFullerene Chemistry and Applications · Graph theory and applications
