On the Cartesian product of non well-covered graphs
Combinatorics
2012-05-01 v1 Discrete Mathematics
Abstract
A graph is well-covered if every maximal independent set has the same cardinality, namely the vertex independence number. We answer a question of Topp and Volkmann and prove that if the Cartesian product of two graphs is well-covered, then at least one of them must be well-covered.
Keywords
Cite
@article{arxiv.1204.6681,
title = {On the Cartesian product of non well-covered graphs},
author = {Bert L. Hartnell and Douglas F. Rall},
journal= {arXiv preprint arXiv:1204.6681},
year = {2012}
}