RT journal article
T1 On the total version of the covering Italian domination problem
A1 Raju M., Alfred
A1 Palagiri, Venkata S.R.
A1 González Yero, Ismael
A2 Matemáticas
K1 Covering total italian domination number
K1 Vertex cover number
K1 Independence number
K1 Total co-independent domination
K1 Italian domination
AB Given a graph G without isolated vertices, a function f : V(G) → {0, 1, 2} is a coveringtotal Italian dominating function if (i) the set of vertices labeled with 0 forms anindependent set; (ii) every vertex labeled with 0 is adjacent to two vertices labeledwith 1 or to one vertex labeled with 2; and (iii) the set of vertices labeled with 1 or 2forms a total dominating set. The covering total Italian domination number of G is thesmallest possible value of the sum ∑v∈V(G)f (v) among all possible covering total Italiandominating functions f on V(G).The concepts above are introduced in this article, and the study of its combinatorialand computational properties is initiated. Specifically, we show several relationshipsbetween such parameter and other domination related parameters in graphs. We alsoprove the NP-completeness of the related decision problem for bipartite graphs, andpresent some approximation results on computing our parameter. In addition, wecompute the exact value of the covering total Italian domination number of some graphswith emphasis on some Cartesian products.
PB Elsevier
SN 0166-218X
YR 2024
FD 2024
LK http://hdl.handle.net/10498/35785
UL http://hdl.handle.net/10498/35785
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 10-may-2026