Total equality Co-neighborhood domination in a graph
Sahib Sh. Kahat, Manal Naji Al-harere · AIP conference proceedings · 2023
Let G = (V, E) be a simple and undirected graph without isolated vertices. A subset D ⊂ V such that D ≠ V is calledthe total equality co-neighborhood dominating set of G (TENDS), if satisfy the following condition that ∀ v ∈ D has property that it isadjacent to the same number of vertices in the set V – D where D is a total dominating set of G. In this paper, TENDS in graphs is defined. Some properties of TENDS are determined for some special graph