From (secure) w-domination in graphs to protection of lexicographic product graphs

DOI10.1007/S40840-021-01141-8MaRDI QIDQ2239006zbMATH OpenOpenAlexFDO

Authors Abel Cabrera Martínez, Alejandro Estrada-Moreno, Juan A. Rodríguez-Velázquez

Publication date 2 November 2021

Published in Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2105.05199

weak Roman domination lexicographic product secure domination \(w\)-domination secure \(w\)-domination

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Abstract: Let

w = (w_{0}, w_{1}, d o t s, w_{l})

be a vector of nonnegative integers such that

w_{0} g e 1

. Let

G

be a graph and

N (v)

the open neighbourhood of

v i n V (G)

. We say that a function

f : V (G) l o n g r i g h t a r r o w 0, 1, d o t s, l

is a

w

-dominating function if

f (N (v)) = s u m_{u i n N (v)} f (u) g e w_{i}

for every vertex

v

with

f (v) = i

. The weight of

f

is defined to be

o m e g a (f) = s u m_{v i n V (G)} f (v)

. Given a

w

-dominating function

f

and any pair of adjacent vertices

v, u i n V (G)

with

f (v) = 0

and

f (u) > 0

, the function

f_{u i g h t a r r o w v}

is defined by

f_{u i g h t a r r o w v} (v) = 1

,

f_{u i g h t a r r o w v} (u) = f (u) - 1

and

f_{u i g h t a r r o w v} (x) = f (x)

for every

x i n V (G) s e t m i n u s u, v

. We say that a

w

-dominating function

f

is a secure

w

-dominating function if for every

v

with

f (v) = 0

, there exists

u i n N (v)

such that

f (u) > 0

and

f_{u i g h t a r r o w v}

is a

w

-dominating function as well. The (secure)

w

-domination number of

G

, denoted by (

g a m m a_{w}^{s} (G)

)

g a m m a_{w} (G)

, is defined as the minimum weight among all (secure)

w

-dominating functions. In this paper, we show how the secure (total) domination number and the (total) weak Roman domination number of lexicographic product graphs

G c i r c H

are related to

g a m m a_{w}^{s} (G)

or

g a m m a_{w} (G)

. For the case of the secure domination number and the weak Roman domination number, the decision on whether

w

takes specific components will depend on the value of

g a m m a_{(1, 0)}^{s} (H)

, while in the case of the total version of these parameters, the decision will depend on the value of

g a m m a_{(1, 1)}^{s} (H)

.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: From (secure) \(w\)-domination in graphs to protection of lexicographic product graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2239006)