Secure Italian domination in graphs

M. Dettlaff (), M. Lemańska () and J. A. Rodríguez-Velázquez ()
Additional contact information
M. Dettlaff: Gdansk University of Technology
M. Lemańska: Gdansk University of Technology
J. A. Rodríguez-Velázquez: Universitat Rovira i Virgili

Journal of Combinatorial Optimization, 2021, vol. 41, issue 1, No 5, 56-72

Abstract: Abstract An Italian dominating function (IDF) on a graph G is a function $$f:V(G)\rightarrow \{0,1,2\}$$ f : V ( G ) → { 0 , 1 , 2 } such that for every vertex v with $$f(v)=0$$ f ( v ) = 0 , the total weight of f assigned to the neighbours of v is at least two, i.e., $$\sum _{u\in N_G(v)}f(u)\ge 2$$ ∑ u ∈ N G ( v ) f ( u ) ≥ 2 . For any function $$f:V(G)\rightarrow \{0,1,2\}$$ f : V ( G ) → { 0 , 1 , 2 } and any pair of adjacent vertices with $$f(v) = 0$$ f ( v ) = 0 and u with $$f(u) > 0$$ f ( u ) > 0 , the function $$f_{u\rightarrow v}$$ f u → v is defined by $$f_{u\rightarrow v}(v)=1$$ f u → v ( v ) = 1 , $$f_{u\rightarrow v}(u)=f(u)-1$$ f u → v ( u ) = f ( u ) - 1 and $$f_{u\rightarrow v}(x)=f(x)$$ f u → v ( x ) = f ( x ) whenever $$x\in V(G){\setminus }\{u,v\}$$ x ∈ V ( G ) \ { u , v } . A secure Italian dominating function on a graph G is defined as an IDF f which satisfies that for every vertex v with $$f(v)=0$$ f ( v ) = 0 , there exists a neighbour u with $$f(u)>0$$ f ( u ) > 0 such that $$f_{u\rightarrow v}$$ f u → v is an IDF. The weight of f is $$\omega (f)=\sum _{v\in V(G) }f(v)$$ ω ( f ) = ∑ v ∈ V ( G ) f ( v ) . The minimum weight among all secure Italian dominating functions on G is the secure Italian domination number of G. This paper is devoted to initiating the study of the secure Italian domination number of a graph. In particular, we prove that the problem of finding this parameter is NP-hard and we obtain general bounds on it. Moreover, for certain classes of graphs, we obtain closed formulas for this novel parameter.

Keywords: Domination number; Secure domination number; Italian domination; Secure Italian domination; 05C69 (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00658-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:41:y:2021:i:1:d:10.1007_s10878-020-00658-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-020-00658-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().