Total Domination in Uniform Single Valued Neutrosophic Graph
Keywords:
Domination; Total domination; Single-valued neutrosophic graphs; Neutrosophic strong arcs.Abstract
In graph theory, the neutrosophic graph is a new extension of the intuitionistic fuzzy graph and
fuzzy graph. It offers greater accuracy and flexibility in scheduling and implementing numerous real-life issues.
The introduction of neutrosophic graphs has opened up an excellent opportunity to portray real-world situations
with incomplete and ambiguous information. These neutrosophic graph models are used in many industrial
and scientific domains to simulate various problems. This article offers a new approach for calculating the
total dominating set of a given single-valued neutrosophic graph using neutrosophic strong arcs. An example
is illustrated for calculating the total dominating sets of single-valued neutrosophic graphs. Moreover, certain
observations related to uniform single-valued neutrosophic graphs are covered and we also suggest an application
of a total dominating set in single-valued neutrosophic graphs in the real world.
Downloads
![](https://fs.unm.edu/nss8/public/journals/1/article_4766_cover_en.png)
Downloads
Published
Issue
Section
License
Copyright (c) 2024 Neutrosophic Sets and Systems
![Creative Commons License](http://i.creativecommons.org/l/by/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution 4.0 International License.