The Number of Independent Sets in a Grid Graph
نویسندگان
چکیده
منابع مشابه
The Number of Independent Sets in a Grid Graph
Let Gm,n be the m×n grid graph. That is, the vertices of Gm,n are the (m+1)(n+1) points (i, j) (0 ≤ i ≤ m, 0 ≤ j ≤ n) in the plane, and its edges are all of the pairs (i, j), (i′, j′) of vertices for which |i − i′| + |j − j′| = 1. Let f(m,n) be the number of independent sets of vertices in Gm,n. We study the growth of f(m,n). The figure below shows an independent set S in G4,6. figure=grid.eps ...
متن کاملThe Number of Independent Sets in a Regular Graph
We show that the number of independent sets in an N -vertex, d-regular graph is at most (2−1), where the bound is sharp for a disjoint union of complete d-regular bipartite graphs. This settles a conjecture of Alon in 1991 and Kahn in 2001. Kahn proved the bound when the graph is assumed to be bipartite. We give a short proof that reduces the general case to the bipartite case. Our method also ...
متن کاملOn the number of maximal independent sets in a graph
Let G be a (simple, undirected, finite) graph. A set S ⊆ V (G) is independent if no edge of G has both its endpoints in S. An independent set S is maximal if no independent set of G properly contains S. Let MIS(G) be the set of all maximal independent sets in G. Miller and Muller (1960) and Moon and Moser (1965) independently proved that the maximum, taken over all n-vertex graphs G, of |MIS(G)...
متن کاملLine completion number of grid graph Pn × Pm
The concept of super line graph was introduced in the year 1995 by Bagga, Beineke and Varma. Given a graph with at least r edges, the super line graph of index r, Lr(G), has as its vertices the sets of r-edges of G, with two adjacent if there is an edge in one set adjacent to an edge in the other set. The line completion number lc(G) of a graph G is the least positive integer r for which Lr(G) ...
متن کاملon the number of maximum independent sets of graphs
let $g$ be a simple graph. an independent set is a set ofpairwise non-adjacent vertices. the number of vertices in a maximum independent set of $g$ isdenoted by $alpha(g)$. in this paper, we characterize graphs $g$ with $n$ vertices and with maximumnumber of maximum independent sets provided that $alpha(g)leq 2$ or $alpha(g)geq n-3$.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 1998
ISSN: 0895-4801,1095-7146
DOI: 10.1137/s089548019528993x