Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Code for polyomino and computer search of isospectral polyominoes

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

A new code, binary 2-dimentional code (B2DC), is proposed for polyominoes. An algorithm based on the B2DC and the reverse search method are proposed for enumerating nonisomorphic planar simply connected polyominoes. An enumeration tree and a new father-son relationship are defined for enumerating polyominoes. Then we propose an algorithm to build adjacent matrices and laplacian matrices by B2DCs of polyominoes and search isospectral polyomino graphs by computing characteristic polynomials of those matrices.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  • Avis D, Fukuda K (1996) Reverse search for enumeration. Discret Appl Math 65:21–46

    Article  MathSciNet  MATH  Google Scholar 

  • Babić D, Gutman I (1992) On isospectral benzenoid graphs. J Math Chem 9:261–278

    Article  Google Scholar 

  • Babić D (1993) Isospectral benzenoid graphs with an odd number of vertices. J Math Chem 12:137–146

    Article  MathSciNet  Google Scholar 

  • Caporossi G, Hansen P (1998) Enumeration of Polyhex Hydrocarbons to h=21. J Chem Inf Comput Sci 38:610–619

    Article  Google Scholar 

  • Cioslowski J (1991) A conjecture on benzenoid graphs. J Math Chem 6:111–111

    Article  Google Scholar 

  • Conway AR (1995) Enumerating 2D percolation series by the finite lattice method. J Phys A Math Gen 28:335–349

    Article  MATH  Google Scholar 

  • Conway AR, Guttmann AJ (1995) On two-dimensional percolation. J Phys A Math Gen 28:891–904

    Article  MATH  Google Scholar 

  • Golomb S (1994) Polyominoes: puzzles, patterns, problems and packings, Second edn. Princeton University Press, Princetion

    MATH  Google Scholar 

  • Gutman I, Marković S, Grbović V (1991) The smallest pair of isospectral benzenoid systems. J Serb Chem Soc 56:553–554

    Google Scholar 

  • Hansen P, Lebatteux C, Zheng M (1996) The boundary-edges code for polyhexes. Theochem J Mol Struct 363:237–247

    Article  Google Scholar 

  • Harary F, Palmer E (1973) Graphical enumeration. Academic Press, New York

    MATH  Google Scholar 

  • Jensen I (2001) Enumerations of lattice animals and trees. J Stat Phys 102:865–881

    Article  MathSciNet  MATH  Google Scholar 

  • Jensen I, Guttmann AJ (2000) Statistics of lattice animals (polyominoes) and polygons. J Phys A 33:L257–L263

    Article  MathSciNet  MATH  Google Scholar 

  • Jensen I (2003) Counting polyominoes: a parallel implementation for cluster computing. LNCS 2659:203–212

    Google Scholar 

  • Liang X, Meng J (2011) Computer search for isospectral benzenoid graphs. MATCH Commun Math Comput Chem 65:427–430

    MathSciNet  MATH  Google Scholar 

  • Mertens S (1990) Lattice animals: A fast enumeration algorithm and new perimeter polynomials. J Stat Phys 58:1095–1108

    Article  MathSciNet  Google Scholar 

  • Oliveira e Silva T (2015) http://sweet.ua.pt/tos/animals/a44.html. Accessed 19 Dec 2014

  • Redelmeier DH (1981) Counting polyominoes: yet another attack. Discret Math 36:191–203

    Article  MathSciNet  MATH  Google Scholar 

  • Zheng S, Wang Z, Zhang J, Xin X (1996) A result of searching for isospectral benzenoid graphs. J Xinjiang Univ (Nat Sci Ed) 13:21,28

    Google Scholar 

Download references

Acknowledgments

The authors are grateful to the anonymous referees for their careful reading and valuable comments to improve this paper. The research is supported by NSFC(11171283).

Author information

Authors and Affiliations

  1. College of Mathematics and Systems Science, Xinjiang University, Urumqi, 830046, Xinjiang, People’s Republic of China

    Xiaodong Liang, Rui Wang & Ji xiang Meng

Authors
  1. Xiaodong Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rui Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ji xiang Meng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ji xiang Meng.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liang, X., Wang, R. & Meng, J.x. Code for polyomino and computer search of isospectral polyominoes. J Comb Optim 33, 254–264 (2017). https://doi.org/10.1007/s10878-015-9953-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-015-9953-z

Keywords

Search

Navigation