Answers are grounded in this paper and cite their sources.
The paper characterizes domination value in graphs, including Petersen and complete n-partite graphs, revealing important properties.
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex in D. A dominating set of G of minimum cardinality is called a γ(G)-set. For each vertex v ∈ V (G), we define the domination value of v to be the number of γ(G)-sets to which v belongs. In this paper, we study some basic properties of the domination value function, thus initiating a local study of domination in graphs. Further, we characterize domination value for the Petersen graph, complete n-partite graphs, cycles, and paths.
No takes yet. Share an insight, caveat, or question.
Eunjeong Yi (2012) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: