- Title
- On the anti-Kekule number of fullerenes
- Creator
- Yang, Qin; Ye, Dong; Zhang, Hephing; Lin, Yuqing
- Relation
- Match: Communications in Mathematical and in Computer Chemistry Vol. 67, Issue 2, p. 281-288
- Relation
- http://match.pmf.kg.ac.rs/content67n2.htm
- Publisher
- Univerzitet u Kragujevcu
- Resource Type
- journal article
- Date
- 2012
- Description
- The anti-Kekule number of a connected graph G is the smallest number of edges whose removal from G results in a connected subgraph without Kekule structures (perfect matchings). K. Kutnar et al. showed that the anti-Kekule number of leapfrog fullerene graphs is either 3 or 4 [On the anti-Kekule number of leapfrog fullerenes, J. Math. Chem. 45 (2009) 431-441]. In this paper, we show that the anti-Kekule number is always equal to 4 for all fullerene graphs.
- Subject
- fullerene; carbon atoms; Kekule; Tutte's theorem
- Identifier
- http://hdl.handle.net/1959.13/1317856
- Identifier
- uon:23527
- Identifier
- ISSN:0340-6253
- Language
- eng
- Full Text
- Reviewed
- Hits: 2597
- Visitors: 3232
- Downloads: 505
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | ATTACHMENT02 | Publisher version (open access) | 154 KB | Adobe Acrobat PDF | View Details Download |