The Number of Independent Sets in a Grid Graph
From MaRDI portal
Publication:4388978
DOI10.1137/S089548019528993XzbMath0910.05007OpenAlexW2053015204MaRDI QIDQ4388978
Neil J. Calkin, Herbert S. Wilf
Publication date: 11 May 1998
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s089548019528993x
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Asymptotic enumeration (05A16)
Related Items (32)
Enumeration of matchings in complete \(q\)-ary trees ⋮ Graphs, partitions and Fibonacci numbers ⋮ Tutte polynomials for benzenoid systems with one branched hexagon ⋮ A Method for Computing the Merrifield–Simmons Index on Benzenoid Systems ⋮ Capacity of Higher-Dimensional Constrained Systems ⋮ Enumeration problems for classes of self-similar graphs ⋮ Extremal polyomino chains on \(k\)-matchings and \(k\)-independent sets ⋮ Upper bounds on the growth rates of independent sets in two dimensions via corner transfer matrices ⋮ The channel capacity of read/write isolated memory ⋮ The spectrum and spanning trees of polyominos on the torus ⋮ Nonograms: combinatorial questions and algorithms ⋮ The transfer matrices and the capacity of the 2-dimensional \((1, \infty)\)-runlength limited constraint ⋮ Constructing edge-disjoint Steiner paths in lexicographic product networks ⋮ Enumerating independent vertex sets in grid graphs ⋮ Independent sets in graphs ⋮ On the number of maximal independent sets in complete \(q\)-ary trees ⋮ REPETITIONS, FULLNESS, AND UNIFORMITY IN TWO-DIMENSIONAL WORDS ⋮ Approximating the hard square entropy constant with probabilistic methods ⋮ Rainbow vertex-connection and graph products ⋮ Merrifield-Simmons index and its entropy of the 4-8-8 lattice ⋮ Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks ⋮ The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math>-independence number of graph products ⋮ Monochromatic connectivity and graph products ⋮ Path-connectivity of lexicographic product graphs ⋮ New upper and lower bounds on the channel capacity of read/write isolated memory ⋮ Random maximal independent sets and the unfriendly theater seating arrangement problem ⋮ Sequential cavity method for computing free energy and surface pressure ⋮ Theory of computation of multidimensional entropy with an application to the monomer-dimer problem ⋮ Planar lattice gases with nearest-neighbor exclusion ⋮ Several constants arising in statistical mechanics ⋮ Reconstruction of binary matrices under adjacency constraints ⋮ Excuse me! or the courteous theatregoers' problem
This page was built for publication: The Number of Independent Sets in a Grid Graph
