Total domination value in graphs

Publication date 16 February 2015

Abstract: A set

D s u b s e t e q V (G)

is a emph{total dominating set} of

G

if for every vertex

v i n V (G)

there exists a vertex

u i n D

such that

u

and

v

are adjacent. A total dominating set of

G

of minimum cardinality is called a

g a m m a_{t} (G)

-set. For each vertex

v i n V (G)

, we define the emph{total domination value} of

v

,

T D V (v)

, to be the number of

g a m m a_{t} (G)

-sets to which

v

belongs. This definition gives rise to emph{a local study of total domination} in graphs. In this paper, we study some basic properties of the

T D V

function; also, we derive explicit formulas for the

T D V

of any complete n-partite graph, any cycle, and any path.

Recommendations

Cited in

(3)

This page was built for publication: Total domination value in graphs