On the Cartesian product of non well-covered graphs
classification
🧮 math.CO
cs.DM
keywords
well-coveredcartesiangraphsproductanswercardinalityeverygraph
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.