Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs

zbMath1400.05173arXiv1701.05886MaRDI QIDQ4558969

Didem Gözüpek, Ademir Hujdurović, Martin Milanič

Publication date: 30 November 2018

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

zbMATH Keywords

lexicographic product of graphsminimal dominating setwell-dominated graphirreducible dominating set

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)

Related Items (7)

On well-dominated graphs ⋮ Recognizing well-dominated graphs is coNP-complete ⋮ A characterization of well-dominated Cartesian products ⋮ Domination in rose window graphs ⋮ Domination related parameters in the generalized lexicographic product of graphs ⋮ Well-totally-dominated graphs ⋮ On well-dominated direct, Cartesian and strong product graphs

This page was built for publication: Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs