The Hn- Edge Domination in Graphs

Authors

Ammar Alsinai, Department of Mathematics, University of Mysore, Mysore IndiaFollow
Ahmed Omran, Department of Mathematics, College of Education for Pure Science, University of Babylon, Babylon, IraqFollow
Haneen Oda, Department of Mathematics, College of Education for Pure Science, University of Babylon, Babylon, IraqFollow
Prashanth Nandappa, Department of Computer Science and Engineering, KG Reddy College of Engineering and Technology, Hyderabadad-500075, IndiaFollow

Abstract

The purpose of this paper is initiate new parameter of domination is called the Hn-edge domination number. This number is determined for the regular graph, the graph has spanning cycle subgraph, and some certain graphs. Moreover, the complement of these graph are calculated. Finally, the effect of removal vertex or removal or add an edge are discussed.

Recommended Citation

Alsinai, Ammar; Omran, Ahmed; Oda, Haneen; and Nandappa, Prashanth (2022) "The Hn- Edge Domination in Graphs," Information Sciences Letters: Vol. 11 : Iss. 5 , PP -.
Available at: https://digitalcommons.aaru.edu.jo/isl/vol11/iss5/3