Skip to main content
SpringerLink
Log in

A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs

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

Abstract

An essentially disconnected generalized polyomino graph is defined as a generalized polyomino graph with some perfect matchings and forbidden edges. The number of perfect matchings of a generalized polyomino graph G is the product of the number of perfect matchings of each elementary component in G. In this paper, we obtain a lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Article  Google Scholar 

  2. Bondy J.A., Murty U.S.: Graph Theory and its Applications. The Macmillan Press, London (1976)

    Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  5. Chen R.S.: Perfect matchings of generalized polyomino graphs. Graphs Combin. 21, 515–529 (2005)

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  CAS  Google Scholar 

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

    Article  CAS  Google Scholar 

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

    Google Scholar 

  10. Kasteleyn P.W.: 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 

  11. Lovász L., Plummer M.D.: Matching Theory. Elsevier Science, Amsterdam (1986)

    Google Scholar 

  12. Liu Z.F., Chen R.S.: The structure character of essentially disconnected polyomino graphs. J. Math. Chem. 49(2), 489–506 (2011)

    Article  CAS  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  15. J. Propp, Enumeration of matchings: problems and progress, vol. 38 (MSRI Publications, Cambridge University Press, Cambridge, 1999), pp. 255-291

  16. H. Sachs, Counting perfect matchings in lattice graphs, in Topics in Combinatorics and Graph Theory (Physica-Verlag 1990), pp. 577-584.

  17. Wei S.L., Ke X.L.: Elementary components of essentially disconnected polyomino graphs. J. Math. Chem. 47(1), 496–504 (2010)

    Article  CAS  Google Scholar 

  18. Walker P.D., Mezey P.G.: 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 

  19. Zhang H.P., Zhang F.J.: Perfect matchings of polyomino graphs. Graphs Combin. 13, 295–304 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Minjiang University Fuzhou, 350108, Fujian, People’s Republic of China

    Xiaoling Ke

Authors
  1. Xiaoling Ke
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaoling Ke.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ke, X. A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs. J Math Chem 50, 131–140 (2012). https://doi.org/10.1007/s10910-011-9900-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10910-011-9900-x

Keywords

Search

Navigation