Equitable Domination in Neutrosophic Graphs

                                                   ^∗M.M ullai¹, S. Broumi², Florentin Smarandache³, P.K.Santhi⁴

        ¹Department of Mathematics(DDE), Alagappa University, Karaikudi-630003.

         ²Laboratory of Information processing, University Hassan II, B.P 7955, Sidi Othman, Casablanca, Morocco.

          ³Department of Mathematics, University of New Mexico, 705 Gurley Avenue, Gallup, NM 87301, USA.

            ⁴Department of Mathematics, Jayaraj Annapackiam College for Women (Autonomous), Periyakulam,

Theni(Dist)Tamilnadu, India

Emails; mullaim@alagappauniversity.ac.in¹, broumisaid78@gmail.com², smarand@unm.edu³,

pksanthimat@annejac.ac.in ⁴

Abstract

This paper shows the equitable domination in neutrosophic graphs. In this proposed work, equitable neigh-bourhood of a vertex and equitabe degree are defined. Minimal neutrosophic dominating sets, minimal and maximal equitable independent sets,strong and weak equitable dominating sets in neutrosophic graphs are likewise settled. A few hypotheses on equitable domination in neutrosophic graphs are inferred with numeri-cal examples.

Keywords: Neutrosophic set, neutrosophic graph, neutrosophic equitable dominating set, neutrosophic equi-table degree, neutrosophic equitable independent set.