Abstract
The Anti-Kekulé number of a connected graph G is the smallest number of edges that have to be removed from G in such way that G remains connected but it has no Kekulé structures. In this paper it is proved that the Anti-Kekulé number of all fullerenes is either 3 or 4 and that for each leapfrog fullerene the Anti-Kekulé number can be established by observing finite number of cases not depending on the size of the fullerene.
Similar content being viewed by others
References
Todescini R., Consonni V.: Handbook of Molecular Descriptors. Weinheim, Wiley-VCH (2000)
Trinajstić N.: Chemical Graph Theory. CRC Press, Boca Raton (1992)
L. Lovász, M.D. Plummer, Matching Theory (Elsevier, North-Holland, Amsterdam, 1991)
Gutman I., Polansky O.: Mathematical Concepts in Organic Chemistry. Springer-Verlag, Berlin (1986)
Randić M.: Chem. Rev. 103, 3449 (2003)
Kratschmer W., Lamb L., Fostiropoulos K., Huffman D.: Nature 347, 354 (1990)
Kroto H.W., Heath J.R., O’Brien S.C., Curl R.F., Smalley R.E.: Nature 318, 162 (1985)
Randić M., Kroto H., Vukičević D.: J. Chem. Inf. Mod. 47, 897 (2007)
Vukičević D., Kroto H.W., Randić M.: Croatica Chemica Acta 78, 223 (2005)
Vukičević D., Randić M.: Chem. Phys. Lett. 401(4–6), 446 (2005)
M. Randič, H.W. Kroto, D. Vukičević, Adv. Quantum Chem. (submitted)
D. Vukičević, N. Trinajstić, J. Math. Chem. (accepted for publication)
D. Vukičević, Anti-Kekulé Number of C60 (preprint)
Fowler P.W., Manolopoulos D.E.: An Atlas of Fullerenes. Clarendon Press, Oxford (1995)
Diudea M.V., John P.E., Graovac A., Primorac M., Pisanski T.: Croatica Chemica Acta 76, 153 (2003)
Došlić T.: J. Math. Chem. 33, 103 (2003)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kutnar, K., Sedlar, J. & Vukičević, D. On the anti-Kekulé number of leapfrog fullerenes. J Math Chem 45, 431–441 (2009). https://doi.org/10.1007/s10910-008-9416-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10910-008-9416-1