The Fibonacci number of a grid graph and a new class of integer sequences.
Euler, Reinhardt (2005)
Journal of Integer Sequences [electronic only]
Similarity:
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.
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.
A -analogue of Graham, Hoffman and Hosoya's theorem.
Sivasubramanian, Sivaramakrishnan (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Small forbidden configurations. II.
Anstee, Richard, Ferguson, Ron, Sali, Attila (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Combinatorial algorithms for computing column space bases that have sparse inverses.
Pinar, Ali, Chow, Edmond, Pothen, Alex (2006)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Similarity:
Kasteleyn cokernels.
Kuperberg, Greg (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the number of 2-factors in rectangular lattice graphs.
Bodroža-Pantić, Olga, Tošić, Ratko (1994)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Some new formulas for .
Almkvist, Gert, Krattenthaler, Christian, Petersson, Joakim (2003)
Experimental Mathematics
Similarity:
Thin Lehman matrices and their graphs.
Wang, Jonathan (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Comparison of algorithms in graph partitioning
Alain Guénoche (2008)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
We first describe four recent methods to cluster vertices of an undirected non weighted connected graph. They are all based on very different principles. The fifth is a combination of classical ideas in optimization applied to graph partitioning. We compare these methods according to their ability to recover classes initially introduced in random graphs with more edges within the classes than between them.