On the Cartesian product of non well-covered graphs (Q1953503): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:29, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Cartesian product of non well-covered graphs |
scientific article |
Statements
On the Cartesian product of non well-covered graphs (English)
0 references
7 June 2013
0 references
Summary: A graph is well-covered if every maximal independent set has the same cardinality, namely the vertex independence number. We answer a question of \textit{J. Topp} and \textit{L. Volkmann} [Ars Comb. 33, 199--215 (1992; Zbl 0776.05090)] and prove that if the Cartesian product of two graphs is well-covered, then at least one of them must be well-covered.
0 references
maximal independent set
0 references
well-covered
0 references
Cartesian product
0 references
