Counting Maximal Distance-Independent Sets in Grid Graphs

Reinhardt Euler; Paweł Oleksik; Zdzisław Skupień

Displaying similar documents to “Counting Maximal Distance-Independent Sets in Grid Graphs”

The Fibonacci number of a grid graph and a new class of integer sequences.

Euler, Reinhardt (2005)

Journal of Integer Sequences [electronic only]

Similarity:

Independent sets on path-schemes.

Kitaev, Sergey (2006)

Journal of Integer Sequences [electronic only]

Similarity:

A family of nonregular distance monotone graphs

Michel Mollard (1990)

Czechoslovak Mathematical Journal

Similarity:

The Well-Covered Dimension Of Products Of Graphs

Isaac Birnbaum, Megan Kuneli, Robyn McDonald, Katherine Urabe, Oscar Vega (2014)

Discussiones Mathematicae Graph Theory

Similarity:

We discuss how to find the well-covered dimension of a graph that is the Cartesian product of paths, cycles, complete graphs, and other simple graphs. Also, a bound for the well-covered dimension of Kn × G is found, provided that G has a largest greedy independent decomposition of length c < n. Formulae to find the well-covered dimension of graphs obtained by vertex blowups on a known graph, and to the lexicographic product of two known graphs are also given.