On the Cartesian product of non well-covered graphs

dc.creator	Hartnell, Bert L.
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.description.provenance	Submitted by Betty McEachern (betty.mceachern@smu.ca) on 2018-03-09T14:27:46Z No. of bitstreams: 1 Hartnell_B_L_article_2013.pdf: 201650 bytes, checksum: b8cbfd4ae1965f3dd89f9ce54dc2fc51 (MD5)	en
dc.description.provenance	Made available in DSpace on 2018-03-09T14:27:46Z (GMT). No. of bitstreams: 1 Hartnell_B_L_article_2013.pdf: 201650 bytes, checksum: b8cbfd4ae1965f3dd89f9ce54dc2fc51 (MD5) Previous issue date: 2013	en
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