On the Sizes of Maximal Independent Sets of Cylindrical Grid Graphs
ABSTRACT. If a graph G has exactly t different sizes of maximal independent sets, G belongs to a collection called ℳ t . For the Cartesian product of the graph Pn , the path of length n, and Cm , the cycle of length m, called cylindrical grid, we present a method to find maximal independent sets hav...
Main Authors: | R.M. BARBOSA, M.R. CAPPELLE |
---|---|
Format: | Article |
Language: | English |
Published: |
Sociedade Brasileira de Matemática Aplicada e Computacional
|
Series: | TEMA |
Subjects: | |
Online Access: | http://www.scielo.br/scielo.php?script=sci_arttext&pid=S2179-84512016000300367&lng=en&tlng=en |
Similar Items
-
The Well-Covered Dimension Of Products Of Graphs
by: Birnbaum Isaac, et al.
Published: (2014-11-01) -
The hardness of the independence and matching clutter of a graph
by: Sasun Hambardzumyan, et al.
Published: (2016-01-01) -
On the relation between the non-commuting graph and the prime graph
by: N. Ahanjideh, et al.
Published: (2012-03-01) -
Independent resolving sets in graphs
by: B. Suganya, et al.
Published: (2021-05-01) -
Counting Maximal Distance-Independent Sets in Grid Graphs
by: Euler Reinhardt, et al.
Published: (2013-07-01)