Inverse Dominating Set in Neutrosophic Graphs

M. Mullai¹, S. Broumi², P.K.Santhi³

                                                            ¹ Department of Mathematics, Alagappa University, Karaikudi, Tamilnadu, India.

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

                                                                             ³Department of Mathematics, Jayaraj Annapackiam College for Women (Autonomous),Periyakulam, Theni(Dist)Tamilnadu, India

Emails :mullaim@alagappauniversity.ac.in¹, broumisaid78@gmail.com², pksanthimat@annejac.ac.in²

Abstract

In this paper, the concept of inverse domination in neutrosophic graph is established. The definition of inverse domination number, inverse dominating set, inverse split and non split dominating sets in neutrosophic graph are developed with suitable examples here. Also, the theorems in inverse domination in neutrosophic graph and the bound on inverse domination number in neutrosophic graph are derived.

Keywords: Neutrosophic Graph, Inverse Dominating Set, Inverse Dominating Number, Neutrosophic Path, Minimum Dominating Set