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: | , |
|---|---|
| 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 |
| Summary: | 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 having different sizes and a lower bound on t, such that these graphs belong to ℳ t . |
|---|---|
| ISSN: | 2179-8451 |