On the Cartesian product of non well-covered graphs

Show simple item record

dc.creator Hartnell, Bert
dc.creator Rall, Douglas F.
dc.date.accessioned 2018-03-09T14:27:46Z
dc.date.available 2018-03-09T14:27:46Z
dc.date.issued 2013-04-30
dc.identifier.issn 1077-8926
dc.identifier.uri http://library2.smu.ca/handle/01/27348
dc.description Publisher's Version/PDF
dc.description.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 (1992) and prove that if the Cartesian product of two graphs is well-covered, then at least one of them must be well-covered. en_CA
dc.language.iso en en_CA
dc.publisher Electronic Journal of Combinatorics en_CA
dc.subject.lcsh Graph theory
dc.subject.lcsh Combinatorial analysis
dc.subject.lcsh Products of subgroups
dc.title On the Cartesian product of non well-covered graphs en_CA
dc.type Text en_CA
dcterms.bibliographicCitation Electronic Journal of Combinatorics 20(2), P21. (2013) en_CA


Files in this item

 
 

This item appears in the following Collection(s)

Show simple item record