Anti-Kekulé number of the {(3, 4), 4}-fullerene*
A {(3,4),4}-fullerene graphG is a 4-regular plane graph with exactly eight triangular faces and other quadrangular faces. An edge subset S of G is called an anti-Kekulé set, if G − S is a connected subgraph without perfect matchings. The anti-Kekulé number of G is the smallest cardinality of anti-Ke...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Frontiers Media S.A.
2023-02-01
|
| Series: | Frontiers in Chemistry |
| Subjects: | |
| Online Access: | https://www.frontiersin.org/articles/10.3389/fchem.2023.1132587/full |