In this work, the study will continue of odd neighbor in Dc domination in graphs. The bounded of this number in general is determined. Also, the bound of this number in the graph which have at least three vertices of degree the order of the graph mines two is calculated. Moreover, compute this number for complement of tree is discussed. Finally, When is this number equal to one? in a graph and complement of a graph are been presented.
Digital Object Identifier (DOI)
H. Aljanaby, Haneen and A. Omran, Ahmed
"Some Properties of Odd Neighbor in Dc Dominating Sets,"
Applied Mathematics & Information Sciences: Vol. 16:
4, Article 10.
Available at: https://digitalcommons.aaru.edu.jo/amis/vol16/iss4/10