The Number of Independent Sets in a Grid Graph

13 years 4 months ago

Download www.ces.clemson.edu

If f(m, n) is the (vertex) independence number of the m × n grid graph, then we show that the double limit η = def limm,n→∞ f(m, n) 1 mn exists, thereby reﬁning earlier results of Weber [2]

Neil J. Calkin, Herbert S. Wilf

Real-time Traffic

Double Limit | Grid | Independence Number | SIAMDM 1998 |

claim paper

» The Number of Independent Sets in a Graph with Small Maximum Degree

» The Number of Independent Sets in a Regular Graph

» On the number of maximal independent sets in a graph

» Using critical sets to solve the maximum independent set problem

» The independence number in graphs of maximum degree three

» Laplacian spectral bounds for clique and independence numbers of graphs

» On graphs with subgraphs having large independence numbers

» Finding Independent Sets in Unions of Perfect Graphs

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	1998
Where	SIAMDM
Authors	Neil J. Calkin, Herbert S. Wilf

Comments (0)

Sciweavers

The Number of Independent Sets in a Grid Graph

Double Limit | Grid | Independence Number | SIAMDM 1998 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers