From Italian domination in lexicographic product graphs to w-domination in graphs

DOI10.26493/1855-3974.2318.FB9MaRDI QIDQ5066972zbMATH OpenOpenAlexFDO

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

Publication date 31 March 2022

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

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

\(k\)-tuple domination \(k\)-domination Italian domination \(w\)-domination lexicographic product graph

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

Abstract: In this paper, we show that the Italian domination number of every lexicographic product graph

G c i r c H

can be expressed in terms of five different domination parameters of

G

. These parameters can be defined under the following unified approach, which encompasses the definition of several well-known domination parameters and introduces new ones. Let

N (v)

denote the open neighbourhood of

v i n V (G)

, and 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

. 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)

. The

w

-domination number of

G

, denoted by

g a m m a_{w} (G)

, is the minimum weight among all

w

-dominating functions on

G

. If we impose restrictions on the minimum degree of

G

when needed, under this approach we can define, for instance, the domination number, the total domination number, the

k

-domination number, the

k

-tuple domination number, the

k

-tuple total domination number, the Italian domination number, the total Italian domination number, and the

k

-domination number. Specifically, we show that

g a m m a_{I} (G c i r c H) = g a m m a_{w} (G)

, where

w i n 2 i m e s {0, 1, 2}^{l}

and

l i n 2, 3

. The decision on whether the equality holds for specific values of

w_{0}, d o t s, w_{l}

will depend on the value of the domination number of

H

. This paper also provides preliminary results on

g a m m a_{w} (G)

and raises the challenge of conducting a detailed study of the topic.

Recommendations

Cites work

Cited in

(7)

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

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