Abstract
<abstract><p>A signed double Italian dominating function (SDIDF) on a graph $ G = (V, E) $ is a function $ f $ from $ V $ to $ \{-1, 1, 2, 3\} $, satisfying (ⅰ) $ \sum_{u\in N[v]}f(u)\ge1 $ for all $ v\in V $; (ⅱ) if $ f(v) = -1 $ for some $ v\in V $, then there exists $ A\subseteq N(v) $ such that $ \sum_{u\in A}f(u)\ge3 $; and (ⅲ) if $ f(v) = 1 $ for some $ v\in V $, then there exists $ A\subseteq N(v) $ such that $ \sum_{u\in A}f(u)\ge2 $. The weight of an SDIDF $ f $ is $ \sum_{v\in V}f(v) $. The signed double Italian domination number of $ G $ is the minimum weight of an SDIDF on $ G $. In this paper, we initiated the study of signed double Italian domination and proved that the decision problem associated with the signed double Italian domination is NP-complete. We also provided tight lower and upper bounds of a signed double Italian domination number of trees, and we characterized the trees achieving these bounds. Finally, we determined the signed double Italian domination number for some well-known graphs.</p></abstract>
Publisher
American Institute of Mathematical Sciences (AIMS)
Reference16 articles.
1. I. Stewart, Defend the Roman empire, Sci. Am., 281 (1999), 136–138.
2. Johns Hopkins magazine, Can you protect the Roman empire? C. ReVelle, 1997. Available from: https://pages.jh.edu/jhumag/0497web/locate3.html.
3. Johns Hopkins magazine, Test your solution to can you protect the Roman empire? C. ReVelle, 1997. Available from: https://pages.jh.edu/jhumag/0697web/revelle.html.
4. E. Cockayne, P. Dreyer, S. M. Hedetniemi, S. T. Hedetniemi, Roman domination in graphs, Discrete Math., 278 (2004), 11–22. http://dx.doi.org/10.1016/j.disc.2003.06.004
5. M. Chellali, T. Haynes, S. Hedetniemi, A. McRae, Roman ${2}$-domination, Discrete Appl. Math., 204 (2016), 22–28. http://dx.doi.org/10.1016/j.dam.2015.11.013