Answers are grounded in this paper and cite their sources.
For given positive integers a, b, and c such that 2≤ a≤ b≤ c, we show that there exists a connected graph G such that γ(G)=a, γ_0(G)=b, and γ₀₀(G)=c where γ is a domination number and γ_0 is an isolate domination number. Moreover, we characterize the doubly isolate dominating set for the lexicographic product of two graphs.
No takes yet. Share an insight, caveat, or question.
Ronel Baluntang (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: