Even Sum Edge Domination in Graph

Authors

  • Ahmed A. Omran Department of Mathematics, College of Education for Pure Sciences, University of Babylon, Babylon, Iraq
  • Ihsan M. Rasheed Department of Mathematics, College of Education for Pure Sciences, University of Kerbala, Karbala, Iraq
  • Sarah Ahmed Obaid Department of Mathematics, College of Education for Pure Sciences, University of Kerbala, Karbala, Iraq
  • Roaa Hatem Talib Department of Mathematics, College of Education for Pure Sciences, University of Kerbala, Karbala, Iraq

Keywords:

Domination, Even Sum Domination, path, thorn path, thorn rod path, certain graphs, lgorithm

Abstract

Various applications of domination and recent work on different forms of domination in graphs have given rise to our interest in exploring in this paper new special type of graph domination. As most papers discussed domination focus more on setting the conditions for the dominant group to come up with a new concept of domination, this pape introduces the new parameter of domination in graph called even sum edge domination set (ESEDS). Many of properties of these numbers are being discussed. Furthermore, for the path and related to it as thorn, thorn path, and thorn rod path are presented. Also, the algorithm of even sum edge domination of path is introduced.

Downloads

Published

2024-12-31

How to Cite

A. Omran, A. ., M. Rasheed, I. ., Ahmed Obaid, S. ., & Hatem Talib, R. . (2024). Even Sum Edge Domination in Graph. Pure Sciences International Journal of Kerbala, 1(4), 59–63. Retrieved from https://journals.uokerbala.edu.iq/index.php/psijk/article/view/2453

Issue

Vol. 1 No. 4 (2024): Pure Sciences International Journal of Kerbala

Section

Articles