Domination Value in Graphs

Details Domination Value in Graphs Domination Value in Graphs

2011-09-28

arxiv.org/abs/1109.6277v2

Mathematics

Combinatorics

14 pages, 5 figures, v2: A few minor changes made. This is the final version, to appear in Contrib. Discrete Math

Scientific paper

A set $D \subseteq V(G)$ is a \emph{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 $\gamma(G)$-set. For each vertex $v \in V(G)$, we define the \emph{domination value} of $v$ to be the number of $\gamma(G)$-sets to which $v$ belongs. In this paper, we study some basic properties of the domination value function, thus initiating \emph{a local study of domination} in graphs. Further, we characterize domination value for the Petersen graph, complete $n$-partite graphs, cycles, and paths.

Affiliated with

Also associated with

No associations

Rating

Domination Value in Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Domination Value in Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Domination Value in Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-44312