Secure Edge Domination in Neutrosophic Graphs
1Department of Mathematics, RV Institute of Technology and Management, Bangalore
2“Laboratory of Information Processing, Faculty of Science Ben M’Sik, University Hassan II, Casablanca, Morocco
Emails: sivshankar@gmail.com; broumisaid78@gmail.com”
* Correspondence: sivshankar@gmail.com
Abstract
The concepts of Neutrosophic secure edge domination number and neutrosophic total secure edge domination number in single valued neutrosophic graphs (SVNG) with strong arcs are introduced and analysed in this paper, and some of their properties are studied. The relationship between the neutrosophic secure edge dominance number and its inverse is presented. The concepts inverse neutrosophic total edge domination set and inverse neutrosophic total edge domination number are also defined. Some of these concepts' properties are investigated.
Keywords: Edge dominating set; Neutrosophic secure edge dominating number; inverse neutrosophic edge domination number.