paper

On well-covered Cartesian products

arXiv:1703.08716

Abstract

In 1970, Plummer defined a well-covered graph to be a graph in which all maximal independent sets are in fact maximum. Later Hartnell and Rall showed that if the Cartesian product is well-covered, then at least one of or is well-covered. In this paper, we consider the problem of classifying all well-covered Cartesian products. In particular, we show that if the Cartesian product of two nontrivial, connected graphs of girth at least is well-covered, then at least one of the graphs is . Moreover, we show that and are the only well-covered Cartesian products of nontrivial, connected graphs of girth at least .

12 pages, 2 figures

On well-covered Cartesian products · wovepaper