Inverse Equality Co-Neighborhood Domination in Graphs
Sahib Sh. Kahat, Manal Naji Al-harere · Journal of Physics Conference Series · 2021
Abstract Let G = (V, E) be a simple undirected graph without isolated vertices. A proper subset D ⊂ V is called equality co-neighborhood dominating set of G (ENDS), if every vertex in set D is adjacent to equally number of vertices in V - D. In this paper, the inverse equality co-neighborhood dominating set of G (IENDS) is defined. Some properties of inverse equality co-neighborhood dominating set are determined. The inverse equality co-neighborhood domination number in some special graphs and three kinds of operations in join graphs is calculated.