Changing and unchanging of the domination number of a graph: path addition numbers

Abstract: Given a graph

G = (V, E)

and two its distinct vertices

u

and

v

. The

(u, v)

-

P_{k}

-{em addition graph} of

G

is the graph

G_{u, v, k - 2}

obtained from disjoint union of

G

and a path

P_{k} : x_{0}, x_{1}, .., x_{k - 1}

,

k g e q 2

, by identifying the vertices

u

and

x_{0}

, and identifying the vertices

v

and

x_{k - 1}

. We prove that (a)

g a m m a (G) - 1 l e q g a m m a (G_{u, v, k})

for all

k g e q 1

, and (b)

g a m m a (G_{u, v, k}) > g a m m a (G)

when

k g e q 5

. We also provide necessary and sufficient conditions for the equality

g a m m a (G_{u, v, k}) = g a m m a (G)

to be valid for each pair

u, v i n V (G)

. pair

u, v i n V (G)

.

Recommendations

Cites Work

Cited In (2)

This page was built for publication: Changing and unchanging of the domination number of a graph: path addition numbers