%0 Journal Article
%T Produtos de grafos Zm-bem-cobertos
%A Barbosa
%A R.M.
%A Santana
%A M.R.C.
%J TEMA (S£¿o Carlos)
%D 2012
%I Scientific Electronic Library Online
%R 10.5540/tema.2012.013.01.0075
%X a graph is zm-well-covered if |i| ¡Ô |j| (mod m), for all i, j maximal independent sets in v(g). a graph g is strongly zm-well-covered if g is a zm-well-covered graph and g\{e} is zm-well-covered, £¿ e ¡Ê e(g). a graph g is zm-well-covered if g is zm-well-covered and g\{v} is zm-well-covered, £¿ e ¡Ê v(g). we prove that k1 and k2 are the only 1-zm-well-covered graphs with girth > 6. they are also the only ones with girth > and strongly zm-well-covered. we show a necessary and sufficient condition for the lexicographic product of graphs to be a zm-well-covered one and some properties for the cartesian product of cycles.
%K graph theory
%K independent sets in graphs
%K graph products.
%U http://www.scielo.br/scielo.php?script=sci_abstract&pid=S2179-84512012000100008&lng=en&nrm=iso&tlng=en