Super dominating sets in graphs

Abstract: Let

G = (V, E)

be a graph. A subset

D

of

V (G)

is called a super dominating set if for every

v i n V (G) - D

there exists an external private neighbour of

v

with respect to

V (G) - D .

The minimum cardinality of a super dominating set is called the super domination number of

G

and is denoted by

g a m m a_{s p} (G)

. In this paper some results on the super domination number are obtained. We prove that if

T

is a tree with at least three vertices, then

f r a c n 2 l e q g a m m a_{s p} (T) l e q n - s,

where

s

is the number of support vertices in

T

and we characterize the extremal trees.

Recommendations

Cites work

Cited in

(16)

This page was built for publication: Super dominating sets in graphs