Research Articles
Published 2023-07-19
Keywords
- Italian Domination,
- Edge Italian Dominating function,
- Edge Italian domination number
Copyright (c) 2023
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Abstract
A function f:E(G) →{0,1,2} is an edge Italian dominating function (EIDF) if it satisfies the rule that every edge with weight 0 is either adjacent to an edge with weight 2 or adjacent to at least two edges with weight 1 each. The weight of an EIDF is ∑_(e∈E(G))▒〖f(e)〗. The minimum ∑_(e∈E(G))▒〖f(e)〗is the edge Italian domination number (EIDN). The symbol (γ_I ) ́ (G) is used to denote the EIDN. In this paper, we obtain the EIDN of some wheel related graphs like gear graph, helm graph, flower graph, web graph etc.
References
- Chellali M, T. W. Haynes, S. T. Hedetniemi, and A. A. McRae, Roman {2}-domination, Discrete Appl. Math. 204(2016), 22–28.
- Cockayne E.J, P.M. Dreyer Jr., S.M. Hedetniemi, and S.T. Hedetniemi, Roman domination in graphs, Discrete Math. 278 (2004), 11–22.
- Harary Frank, Graph Theory, Addison Wesley, Reading Mass, 1969.
- Henning M.A. and W. F. Klostermeyer, Italian domination in trees. Discrete Appl. Math 217(2017), 557–564.
- Jyothi.V and J. Suresh Kumar, Edge Italian domination in graphs. South East Asian J. of Mathematics and Mathematical Sciences, Volume 17 No.2(2021), pp 233-240.
- Mitchell. S and S.T. Hedetniemi, Edge domination in trees, Congr. Numer. 19 (1977), 489–509.
- I. Stewart, Defend the Roman Empire, Sci. Am. 281 (6) (1999) 136–139.