On the Cartesian product of non well-covered graphs (Q1953503): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Bert L. Hartnell / rank | |||
Property / author | |||
Property / author: Bert L. Hartnell / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1204.6681 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the well-coveredness of Cartesian products of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4243055 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some covering concepts in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: WELL-COVERED GRAPHS: A SURVEY / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4014306 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 12:39, 6 July 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