Perfect matchings in random polyomino chain graphs

DOI10.1007/s10910-015-0580-9zbMath1356.92098OpenAlexW2298792700MaRDI QIDQ282170

Xiaoling Ke, Shou Liu Wei, Feng-Gen Lin

Publication date: 12 May 2016

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10910-015-0580-9

zbMATH Keywords

expected valueperfect matchingrandom variablepolyomino chain graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (4)

Comparing the excepted values of atom-bond connectivity and geometric-arithmetic indices in random spiro chains ⋮ On degree-based topological indices of random polyomino chains ⋮ Perfect matchings in random octagonal chain graphs ⋮ Enumeration of Wiener indices in random polygonal chains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial properties of polyominoes
• Chessboard domination problems
• On the queen domination problem
• Matching theory -- a sampler: From Dénes König to the present
• Perfect matchings of polyomino graphs
• The number of Kekulé structures of polyominos on the torus
• Enumeration of perfect matchings of a type of quadratic lattice on the torus
• Perfect matchings of generalized polyomino graphs
• The statistics of dimers on a lattice
• King and domino polynomials for polyomino graphs

This page was built for publication: Perfect matchings in random polyomino chain graphs