Skip to main content
Log in

Perfect matchings in random polyomino chain graphs

  • Original Paper
  • Published:
Journal of Mathematical Chemistry Aims and scope Submit manuscript

Abstract

Let G be a (molecule) graph. A perfect matching, or Kekulé structure of G is a set of independent edges covering every vertex exactly once. Enumeration of Kekulé structures of a graph is interest in chemistry, physics and mathematics. In this paper, we focus on the number of perfect matchings in polyomino chain graphs. Simple exact formulas are given for the expected value of the number of perfect matchings in random polyomino chain graphs and for the asymptotic behavior of this expectation. Moreover, the average value of the number of perfect matchings with respect to the set of all polyomino chain graphs with s square-cells.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. C. Berge, C.C. Chen, V. Chvatal, C.S. Soaw, Combinatorial properties of polyominoes. Combinatorics 1, 217–224 (1981)

    Article  Google Scholar 

  2. E.J. Cockayne, Chessboard domination problems. Discrete Math. 86, 13–20 (1990)

    Article  Google Scholar 

  3. S.J. Cyvin, I. Gutman, Kekulé Structures in Benzenoid Hydrocarbons (Springer, Berlin, 1988)

    Book  Google Scholar 

  4. E. Clar, The Aromatic Sextet (Wiley, London, 1972)

    Google Scholar 

  5. R. Chen, Perfect matchings of generalized polyomino graphs. Gr. Comb. 21, 515–529 (2005)

    Article  Google Scholar 

  6. C.M. Grinstead, B. Hahne, D. Van Stone, On the queen domination problem. Discrete Math. 86, 21–26 (1990)

    Article  Google Scholar 

  7. I. Gutman, The number of perfect matchings in a random hexagonal chain. Gr. Theory Notes N. Y. 16, 26–28 (1989)

    Google Scholar 

  8. I. Gutman, J.W. Kennedy, L.V. Quintas, Perfect matchings in random hexagonal chain graphs. J. Math. Chem. 6, 377–383 (1991)

    Article  CAS  Google Scholar 

  9. I. Gutman, J.W. Kennedy, L.V. Quintas, Wiener numbers of random bezenoid chains. Chem. Phys. Lett. 173, 403–408 (1990)

    Article  CAS  Google Scholar 

  10. G.G. Hall, A graphic model of a class of molecules. Int. J. Math. Educ. Sci. Technol. 4, 233–240 (1973)

    Article  Google Scholar 

  11. F. Harary, P.G. Mezey, Cell-shedding transformations, equivalence relations, and similarity measures for square-cell configurations. Int. Quant. Chem. 62(4), 353–361 (1997)

    Article  CAS  Google Scholar 

  12. F. Harary, P.G. Mezey, The diet transform of lattice patterns, equivalence relations, and similarity measures. Mol. Eng. 6(4), 415–416 (1996)

    Article  CAS  Google Scholar 

  13. P. John, H. Sachs, H. Zerntic, Counting perfect matchings in polyominoes with applications to the dimer problem. Zastosowania Matemetyki (Appl. Math.) 19, 465–477 (1987)

    Google Scholar 

  14. P.W. Kasteleyn, The statistics of dimer on a lattice I: the number of dimer arrangement on a quadratic lattice. Physica 27, 1209–1225 (1961)

    Article  Google Scholar 

  15. F. Lu, L. Zhang, F. Lin, Enumeration of perfect matchings of a type of quadratic lattices on the torus. Electron. J. Combin. 17, R36 (2010)

    Google Scholar 

  16. F. Lu, L. Zhang, F. Lin, Dimer statistics on the Klein bottle. Phys. A 390, 2315–2324 (2011)

    Article  CAS  Google Scholar 

  17. A. Motoyama, H. Hosoya, King and domino polyominals for polyomino graphs. J. Math. Phys. 18, 1485–1490 (1997)

    Article  Google Scholar 

  18. M.D. Plummer, Matching Theory-a sampler: from Dénes Konig to the present. Discrete Math. 100, 177–219 (1992)

    Article  Google Scholar 

  19. J. Propp, Enumeration of matchings: problems and progress, MSRI Publications. Cambridge Univ. Press 38, 255–291 (1999)

    Google Scholar 

  20. L. Pauling, The Nature of Chemical Bond (Cornell University Press, New York, 1939)

    Google Scholar 

  21. H. Sachs, Counting perfect matchings in lattice graphs, In: Topics in combinatorics and graph theory, Physica-Verlag, (1990), 577–584

  22. R. Swinborne-Sheldrake, W.C. Herndon, I. Gutman, Kekulé structures and resonance energies of benzenoid hydrocanbons. Tetrahedron Lett. 16(10), 755–759 (1975)

    Article  Google Scholar 

  23. P.D. Walker, P.G. Mezey, Representation of square-cell configurations in the complex plane: Tools for the characterization of molecular monolayers and cross sections of molecular surfaces. Int. Quant. Chem. 43(3), 375–392 (1992)

    Article  CAS  Google Scholar 

  24. W. Yang, F. Zhang, Wiener index in random polyphenyl chains. MATCH. Commun. Math. Comput. Chem. 68, 371–376 (2012)

    Google Scholar 

  25. H. Zhang, F. Zhang, Perfect matchings of polyomino graphs. Gr. Comb. 13, 295–304 (1997)

    Article  Google Scholar 

  26. L. Zhang, S. Wei, F. Lu, The number of Kekulé structures of polyominos on the torus. J. Math. Chem. 51, 354–368 (2013)

    Article  CAS  Google Scholar 

  27. L. Zhang, The number of matchings and independent-sets with rspected to the polyominoes \(L_n\) and \(Z_n\). J. Math. Study 32, 310–315 (1999)

    Google Scholar 

Download references

Acknowledgments

This work is supported by NSFC Grant#11301085, 11171279, and by Natural Science Foundation of Fujian province Grant# 2015J01589.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shouliu Wei.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wei, S., Ke, X. & Lin, F. Perfect matchings in random polyomino chain graphs. J Math Chem 54, 690–697 (2016). https://doi.org/10.1007/s10910-015-0580-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10910-015-0580-9

Keywords

Navigation