Total Italian Domination: Structural Results on Middle Graphs of Standard Families
DOI:
https://doi.org/10.31185/wjps.836Keywords:
Italian domination, total Italian domination, Middle graphAbstract
If we have graph , an Italian dominating function (IDF) is defined as a mapping satisfying the condition, if for any vertex must be have neighbor there is no fewer than 1 vertex to be or no fewer than 2 vertices where The weight of a (IDF) is the sum of all these functions for all vertices . And the minimum weight selected from overall (IDF) of and indicated by
A total Italian dominating function (TIDF) is an (IDF) if the collection of non-zero elements, each of which is contiguous to at least one non-zero element. A minimum weight of any (TIDF) is referred to as a total Italian domination number indicated by .
We commenced the study of (TIDF) of graph and the graph can be issued by add a new vertex between every two old vertices in and draw the edges between every two added vertices provided that there exist common vertex binds them, we called middle graph of . For selected standard graph families. The accurate numerical values of these graph-related parameters were established.
We determined these parameters' exact values.
References
[1] H. Abdollahzadeh Ahangar, M. Chellali, S.M. Sheikholeslami, and J.C. Valenzuela-Tripodoro, Total Roman f2g-dominating functions in graphs, Discuss. Math. Graph Theory, vol. 42, pp.937958, 2022.
[2] H. Abdollahzadeh Ahangar, M.A. Henning, V. Samodivkin, I. G. Yero, Total Roman domi- nation in graphs. Appl. Anal. Discrete Math. 10(2), (2016) 501 517.
[3] J. Amjadi, S. Nazari-Moghaddam, S. M. Sheikholeslami, Total Roman domination number of trees. Australas. J. Combin. 69 (2017), 271-285.
[4] M. Chellali, T.W. Haynes, S.T. Hedetniemi and A.A. McRae, Roman {2}-domination, Dis- crete Appl. Math. 204 (2016), 22–28.
[5] E.J. Cockayne, P.A. Dreyer, S.M. Hedetniemi and S.T. Hedetniemi, Roman domination in graphs, Discrete Math. 278 (2004), 11–22.
[6] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.
[7] M.A. Henning and W.F. Klostermeyer, Italian domination in trees. Discrete Appl. Math. 217 (2017), 557-564.
[8] B. Samadi, M. Alishahi, I. Masoumi and D. A. Mojdeh, Restrained italian domination in graphs, RAIRO-Oper. Res. 55 (2021) 319-332, https://doi.org/10.1051/ro/2021022.
[9] A.M. Ridha Abdulhasan and D.A. Mojdeh, Further results on (total) restrained italian domination, Discrete Math. Algorithms Appl., (2023) 2350017, DOI: 10.1142/S1793830923500179
[10] P. Roushini Leely Pushpam and S. Padmapriea, Restrained Roman domination in graphs, Transactions on Combinatorics, 4(1) (2015), 1-17.
[11] I. Stewart, Defend the Roman Empire!, Sci. Amer. 281 (1999), 136–139.
[12] L. Volkmann, Remarks on the restrained Italian domination number in graphs, to appesar in Communications in Combinatorics and Optimization, DOI: 10.22049/CCO.2021.27471.1269.
[13] D.B. West, Introduction to Graph Theory. Second Edition, Prentice-Hall, Upper Saddle River, NJ (2001).
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Maryam ALTABATABAII
This work is licensed under a Creative Commons Attribution 4.0 International License.
