Some Properties of Odd Neighbor in Dc Dominating Sets

Authors

Haneen H. Aljanaby, Department of Mathematics, College of Education for Pure Science, University of Babylon, Babylon, IraqFollow
Ahmed A. Omran, Department of Mathematics, College of Education for Pure Science, University of Babylon, Babylon, IraqFollow

Author Country (or Countries)

Iraq

Abstract

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)

http://dx.doi.org/10.18576/amis/160410

Recommended Citation

H. Aljanaby, Haneen and A. Omran, Ahmed (2022) "Some Properties of Odd Neighbor in Dc Dominating Sets," Applied Mathematics & Information Sciences: Vol. 16: Iss. 4, Article 10.
DOI: http://dx.doi.org/10.18576/amis/160410
Available at: https://digitalcommons.aaru.edu.jo/amis/vol16/iss4/10