On the well-coveredness of Cartesian products of graphs

DOI10.1016/j.disc.2007.12.083zbMath1229.05239MaRDI QIDQ998514

Alexandra Ovetsky Fradkin

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.083

zbMATH Keywords

Cartesian products; independent sets; well-covered

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05C76: Graph operations (line graphs, products, etc.)

Related Items

Independent double Roman domination in graphs, The well-covered dimension of products of graphs, Independent Roman \(\{2 \}\)-domination in graphs, On well-covered Cartesian products, On the Cartesian product of non well-covered graphs, Partitions and well-coveredness: the graph sandwich problem, On well-covered direct products, Well-hued graphs, On \(k\)-rainbow independent domination in graphs, Recognizing well covered graphs of families with special \(P _{4}\)-components

Cites Work

• Unnamed Item
• A characterization of well covered graphs of girth 5 or greater
• The structure of well-covered graphs and the complexity of their recognition problems
• Complexity results for well‐covered graphs
• Some covering concepts in graphs