Total Roman domination edge-critical graphs

Abstract: A total Roman dominating function on a graph

G

is a function

% f : V (G) i g h t a r r o w 0, 1, 2

such that every vertex

v

with

f (v) = 0

is adjacent to some vertex

u

with

f (u) = 2

, and the subgraph of

G

induced by the set of all vertices

w

such that

f (w) > 0

has no isolated vertices. The weight of

f

is

S i g m a_{v i n V (G)} f (v)

. The total Roman domination number

g a m m a_{t R} (G)

is the minimum weight of a total Roman dominating function on

G

. A graph

G

is

k

-

g a m m a_{t R}

-edge-critical if

g a m m a_{t R} (G + e) < g a m m a_{t R} (G) = k

for every edge

e i n E (o v e r l i n e G) e q e m p t y s e t

, and

k

-

g a m m a_{t R}

-edge-supercritical if it is

k

-

g a m m a_{t R}

-edge-critical and

g a m m a_{t R} (G + e) = g a m m a_{t R} (G) - 2

for every edge

e i n E (o v e r l i n e G) e q e m p t y s e t

. We present some basic results on

g a m m a_{t R}

-edge-critical graphs and characterize certain classes of

g a m m a_{t R}

-edge-critical graphs. In addition, we show that, when

k

is small, there is a connection between

k

-

g a m m a_{t R}

-edge-critical graphs and graphs which are critical with respect to the domination and total domination numbers.

Recommendations

Cites work

Cited in

(6)

This page was built for publication: Total Roman domination edge-critical graphs