A characterization of well-dominated Cartesian products

DOI10.1016/j.disc.2024.113904arXiv2306.04105OpenAlexW4391424539WikidataQ128831563 ScholiaQ128831563MaRDI QIDQ6124450

Douglas F. Rall, Kirsti Kuenzel

Publication date: 27 March 2024

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

Full work available at URL: https://arxiv.org/abs/2306.04105

zbMATH Keywords

Cartesian productwell-dominated

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• On well-covered Cartesian products
• On the Cartesian product of non well-covered graphs
• On well-dominated direct, Cartesian and strong product graphs
• Well-dominated graphs without cycles of lengths 4 and 5
• On well-dominated graphs
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs
• Well covered simplicial, chordal, and circular arc graphs
• Domination in Graphs: Core Concepts