On the well-coveredness of Cartesian products of graphs

DOI10.1016/J.DISC.2007.12.083MaRDI QIDQ998514zbMATH OpenOpenAlexFDO

Authors Alexandra 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

well-coveredindependent setsCartesian products

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• scientific article; zbMATH DE number 68351
• On the Cartesian product of non well-covered graphs
• The well-covered dimension of products of graphs
• On well-covered Cartesian products
• scientific article; zbMATH DE number 739124
• On the connectivity of Cartesian product of graphs
• On linkedness in the Cartesian product of graphs
• On the gonality of Cartesian products of graphs
• A note on the connectivity of the Cartesian product of graphs

Cites work

• scientific article; zbMATH DE number 68351 (Why is no real title available?)
• A characterization of well covered graphs of girth 5 or greater
• Complexity results for well‐covered graphs
• Some covering concepts in graphs
• The structure of well-covered graphs and the complexity of their recognition problems

Cited in

(18)

• Independent double Roman domination in graphs
• scientific article; zbMATH DE number 5054182 (Why is no real title available?)
• Partitions and well-coveredness: the graph sandwich problem
• Recognizing well covered graphs of families with special \(P _{4}\)-components
• The well-covered dimension of random graphs
• scientific article; zbMATH DE number 68351 (Why is no real title available?)
• On \(k\)-rainbow independent domination in graphs
• scientific article; zbMATH DE number 3995739 (Why is no real title available?)
• On the Cartesian product of non well-covered graphs
• The well-covered dimension of products of graphs
• Well-hued graphs
• Graph operations on weakly well covered graphs
• On well-edge-dominated graphs
• The Cover Time of Cartesian Product Graphs
• On well-covered direct products
• Independent Roman \(\{2 \}\)-domination in graphs
• Characterization of the Cartesian product of complete graphs by convex subgraphs
• On well-covered Cartesian products

This page was built for publication: On the well-coveredness of Cartesian products of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998514)