Equality co-neighborhood domination in graphs
Ahmed Abed Ali Omran, Manal Naji Al-harere, Sahib Sh. Kahat · Discrete Mathematics Algorithms and Applications · 2021
In this work, a new domination parameter is introduced in the graphs, which is called “equality co-neighborhood”. Various types of properties of this parameter have been studied. Additionally, this parameter has been determined for certain graphs, such as complete, path, cycle, wheel, star, and complete bipartite graphs. In addition, three types of graph operations have been discussed with some properties presented for the new type of domination. The first operation is a complement of the graph especially to the charts mentioned above. The second operation is the union of two graphs, and the third operation is the corona of two graphs.