International Journal of Mathematics Trends and Technology
Volume 68 | Issue 11 | Year 2022 | Article Id. IJMTT-V68I11P501 | DOI : https://doi.org/10.14445/22315373/IJMTT-V68I11P501
| Received | Revised | Accepted | Published |
|---|---|---|---|
| 05 Sep 2022 | 13 Oct 2022 | 25 Nov 2022 | 07 Nov 2022 |
The problem of counting perfect matchings in graphs is an extremely difficult and important topic. In this paper, {(3,4),4}-fullerene graphs are classified according to the cyclical edge-connectivity, and then we show that {(3,4),4}-fullerene graph G with cyclical edge-connectivity 4 has exponentially many perfect matchings.
[1] L. Lovász, M. D. Plummer, “Matching Theory,” American Mathematical Society, 2009.
[2] J. Petersen, “The Theory of Regular Graphs,” Acta Mathematica, vol. 15, pp. 193-220, 1891.
[3] G. Frobenius, “About Decomposable Determinants,” Reimer, 1917.
[4] W. T. Tutte, “The Factorization of Linear Graphs,” Journal of the London Mathematical Society, vol. 1, no. 2, pp. 107-111, 1947.
[5] Y. Liu, J. Hao, “The Enumeration of Near-Perfect Matchings of Factor-Critical Graphs,” Discrete Mathematics, vol. 243, no. 1-3, pp. 259-266, 2002.
[6] M. Jünger, G. Reinelt, W. R. Pulleyblank, “On Partitioning the Edges of Graphs Into Connected Subgraphs,” Journal of Graph Theory, vol. 9, no. 4, pp. 539-5492, 1985.
[7] H. Lin, “On the Structure of Graphs with Exactly Two Near-Perfect Matchings,” Ars Combinatoria, vol. 99, pp. 353-358, 2011.
[8] B. Spille, L. Szegő, “A Gallai–Edmonds-Type Structure Theorem for Path-Matchings,” Journal of Graph Theory, vol. 46, no. 2, pp. 93- 102, 2011.
[9] G. G. Hall, “A Graphical Model of a Class of Molecules,” International Journal of Mathematical Education in Science and Technology, vol. 4, no. 3, pp. 233-240, 1973.
[10] R. Swinborne-Sheldrake, W. C. Herndon, I. Gutman, “Kekulé Structures and Resonance Energies of Benzenoid Hydrocarbons,” Tetrahedron Letters, vol. 16, no. 10, pp. 755-758, 1975.
[11] F. Diederich, R. Ettl, Y. Rubin, et al., “The Higher Fullerenes: Isolation and Characterization of C76, C84, C90, C94, and C70O, an Oxide of D5h-C70,” Science, vol. 252, no. 5005, pp. 548-551, 1991.
[12] K. Kikuchi, N. Nakahara, T. Wakabayashi, et al., “NMR Characterization of Isomers of C78, C82 and C84 Fullerenes,” Nature, vol. 357, no. 6374, pp. 142-145, 1992.
[13] T. J. S. Dennis, T. Kai, K. Asato, et al., “Isolation and Characterization by C-13 NMR Spectroscopy of C84 Fullerene Minor Isomers,” The Journal of Physical Chemistry A, vol. 103, no. 44, pp. 8747-8752, 1999.
[14] J. Crassous, J. Rivera, N. S. Fender, et al., “Chemistry of C84: Separation of Three Constitutional Isomers and Optical Resolution of D2- C84 by Using the “Bingel–Retro-Bingel” Strategy,” Angewandte Chemie International Edition., vol. 38, no. 11, pp. 1613-1617, 1999.
[15] G. W. Wang, M. Saunders, A. Khong, et al., “A New Method for Separating the Isomeric C84 Fullerenes,” Journal of the American Chemical Society, vol. 122, no. 13, pp. 3216-3217, 2000.
[16] L. G. Valiant, “The Complexity of Computing the Permanent,” Theoretical Compute Science, vol. 8, no. 2, pp. 189-201, 1979.
[17] M. Deza, M. Sikirić, “Spheric Analogs of Fullerenes,” Ecole Normale Superieure, Paris, and Rudjer Boskovic Institute, Zagreb, 2012.
[18] M. Deza, M. Sikirić, M. Shtogrin, “Fullerene-Like Spheres with Faces of Negative Curvature,” Diamond and Related Nanostructures, Springer, Dordrecht, pp. 251-274, 2013.
[19] T. Došlić, “On Lower Bounds of Number of Perfect Matchings in Fullerene Graphs,” Journal of Mathematical Chemistry, vol. 24, no. 4, pp. 359-364, 1998.
[20] H. Zhang, F. Zhang, “New Lower Bound on the Number of Perfect Matchings in Fullerene Graphs,” Journal of Mathematical Chemistry, vol. 30, no. 3, pp. 343-347, 2001.
[21] F. Kardoš, D. Král, J. Miskuf, et al., “Fullerene Graphs have Exponentially Many Perfect Matchings,” arXiv preprint arXiv:0801.1438, 2008.
[22] Tang Baoxiang, Ren Han, “Perfect Matching Numbers in Two Types of 3-Regular Graphs,” Journal of Sun Yat-Sen University, Natural Science Edition, vol. 53, no. 5, pp. 54-58, 2014.
[23] Tang Baoxiang, Ren Han, “Perfect Matching Numbers in 3-Class 3-Regular Graph,” Journal of Central China Normal University, Natural Science Edition, vol. 48, no. 5, 2014.
[24] R. Yang, C. Liu, S. Wu, “The Facial Resonance of {(3, 4), 4}-Fullerene,” Journal of Com-Binatorial Mathematics and Combinatorial Computing.
[25] J. A. Bondy, U. S. R. Murty, “Graph Theory,” Graduate Texts in Mathematics, Springer, New York, 2008.
Huimin Jia, Rui Yang, Chuanjiao Yu, "The Number of Perfect Matchings of {(3,4),4}-fullerene," International Journal of Mathematics Trends and Technology (IJMTT), vol. 68, no. 11, pp. 1-7, 2022. Crossref, https://doi.org/10.14445/22315373/IJMTT-V68I11P501
PDF 
Abstract 
Keywords 
References 
Citation