Weak Equality Co-Neighbourhood Domination in Graphs

Abstract

When 퐺= (푉, 퐹) be undirected simple and connected graph. And 퐸 ⊂ 푉 

is seed to be weak equality co-neighborhood dominating set of 퐺 dented by 

symbol (WENDS), if the following condition that (every vertex in the set 퐸 

it is associated with the same number of vertices in the remaining set 

(푉 – 퐸) such that degree of vertex (푤) ∀푤∈ 퐸 is lessthan the degree of 

vertex (u) ∀푣∈ 퐸 is achieved. In this paper, we defined WENDS in 

graphs, and determined new properties of WENDS for some types of graphs

.