This paper studies total domination in interval-valued neutrosophic graphs $ (IVN_{graphs}) $, which extend classical graph structures by associating each node and edge with interval-valued degrees of truth, indeterminacy, and falsity. The main objective of this study is to generalize the concept of total domination from single-valued neutrosophic graphs to the interval-valued framework. We introduce formal definitions related to total domination and derive key conditions and properties of total dominating sets. An illustrative example is provided to support the theoretical developments and to demonstrate the applicability of the proposed framework. Extending the traditional domination theory to the interval-valued neutrosophic domain provides a more flexible and realistic model for handling uncertainties in complex network systems and offers a methodological foundation for further research in neutrosophic graph theory.
Citation: T. P. Sreelakshmi, K. Uma Samundesvari. Total domination concepts in interval-valued neutrosophic graphs[J]. AIMS Mathematics, 2026, 11(6): 15435-15447. doi: 10.3934/math.2026634
This paper studies total domination in interval-valued neutrosophic graphs $ (IVN_{graphs}) $, which extend classical graph structures by associating each node and edge with interval-valued degrees of truth, indeterminacy, and falsity. The main objective of this study is to generalize the concept of total domination from single-valued neutrosophic graphs to the interval-valued framework. We introduce formal definitions related to total domination and derive key conditions and properties of total dominating sets. An illustrative example is provided to support the theoretical developments and to demonstrate the applicability of the proposed framework. Extending the traditional domination theory to the interval-valued neutrosophic domain provides a more flexible and realistic model for handling uncertainties in complex network systems and offers a methodological foundation for further research in neutrosophic graph theory.
| [1] | F. Smarandache, Neutrosophic set - A generalization of the intuitionistic fuzzy set, Int. J. Pure Appl. Math., 24 (2005), 287–297. |
| [2] | H. Wang, F. Smarandache, Y. Q. Zhang, R. Sunderraman, Single valued neutrosophic sets, viXra, 2010. |
| [3] | S. Broumi, A. Bakali, M. Talea, F. Smarandache, P. Singh, Properties of interval-valued neutrosophic graphs, In: Fuzzy multi-criteria decision-making using neutrosophic sets, Cham: Springer, 2018,173–202. https://doi.org/10.1007/978-3-030-00045-5_8 |
| [4] | C. Berge, The theory of graphs and its applications, See Description, 1962. |
| [5] | O. Ore, Theory of graphs, Providence: American Mathematical Society, 1962. |
| [6] |
E. J. Cockayne, S. T. Hedetniemi, Towards a theory of domination in graphs, Networks, 7 (1977), 247–261. https://doi.org/10.1002/net.3230070305 doi: 10.1002/net.3230070305
|
| [7] | E. J. Cockayne, R. M. Dawes, S. T. Hedetniemi, Total domination in graphs, Networks, 10 (1980), 211–219. https://doi.org/10.1002/net.3230100304 |
| [8] | A. Nagoorgani, V. T. Chandrasekaran, Domination in fuzzy graph, Adv. Fuzzy Sets Syst., 1 (2006), 17–26. |
| [9] | O. T. Manjusha, M. S. Sunitha, Total domination in fuzzy graphs using strong arcs, Ann. Pure Appl. Math., 9 (2015), 23–33. |
| [10] |
T. P. Sreelakshmi, K. Uma Samundesvari, Total domination in uniform single valued neutrosophic graph, Neutrosophic Sets Syst., 70 (2024), 305–313. https://doi.org/10.5281/zenodo.13175758 doi: 10.5281/zenodo.13175758
|
| [11] | S. Broumi, M. Talea, A. Bakali, F. Smarandache, Single valued neutrosophic graphs, J. New Theory, 10 (2016), 86–101. |
| [12] | S. Broumi, A. Dey, A. Bakali, M. Talea, F. Smarandache, L. H. Son, et al., Uniform single valued neutrosophic graphs, Neutrosophic Sets Syst., 17 (2017), 42–49. |