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...

Full description

Bibliographic Details
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