Secure Dominance in Neutrosophic Graphs

Sivasankar S; Said Broumi

Secure Dominance in Neutrosophic Graphs

Authors

Sivasankar S Department of Mathematics, RV Institute of Technology and Management, Bangalore
Said Broumi Laboratory of Information Processing, Faculty of Science Ben Mâ€™Sik, University Hassan II, Casablanca, Morocco

Keywords:

Dominance set, total dominance neutrosophic number, Secure dominance neutrosophic number, neutrosophic total secure dominance number

Abstract

Secure dominance is a significant proportion of dominance which plays vital role in
communication networks. In this article, we present and analyze an idea of the secured
neutrosophic dominance and totally neutrosophic dominance number of neutrosophic graphs
primarily based on strong arcs and the properties of both notions are studied. The terms 2-
neutrosophic dominance number, 2- secured neutrosophic dominance variety, 2- totally
neutrosophic dominance, and 2- secured neutrosophic dominance number also are defined. Some
of their theoretical properties are investigated.

Downloads

Download data is not yet available.

Downloads

Published

2023-07-01

Issue

Vol. 56 (2023): Neutrosophic Sets and Systems

Section

SI#1,2024: Neutrosophical Advancements And Their Impact on Research

License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

Creative Commons Attribution (CC BY) license.

How to Cite

Sivasankar S, & Said Broumi. (2023). Secure Dominance in Neutrosophic Graphs. Neutrosophic Sets and Systems, 56, 70-81. https://fs.unm.edu/nss8/index.php/111/article/view/3150