Innovative Perspectives On Edge Domination Decomposition In Graphs

Authors

  • E. Shiny Edmund
  • E. Ebin Raja Merly

Keywords:

Decomposition, Edge Domination, Edge Dominating Set, Edge Domination Number

Abstract

A decomposition  is said to be an edge domination decomposition of a connected graph  if  where  is the edge domination number of . In this study, we provide some findings about graphs  edge domination decomposition

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...

References

Arumugam, S., & Velammal, S. (1998). Edge domination in graphs. Taiwanese Journal of Mathematics, 2(2), 173–179.

Ebin Raja Merly, E., & Jeyajothi. (2018). Connected domination decomposition of Helm graph. International Journal of Scientific Research and Review, 7(10), 2279–5432.

Jayaram, S. R. (1987). Line domination in graphs. Graphs and Combinatorics, 3, 357–363.

Mitchell, S., & Hedetniemi, S. T. (1977). Edge domination in trees. Congressus Numerantium, 19, 489–509.

Harary, F. (1998). Graph Theory. Narosa Publishing House.

Kulli, V. R. (1977). Theory of Domination in Graphs. Vishwa International Publication.

Sreedevi, J., & Maheswari, B. (2017). Edge domination number of corona product graph of a cycle with a star. International Journal of Computer Applications, 157(8), 1–5.

Downloads

Published

2025-05-15

How to Cite

1.
Edmund ES, Merly EER. Innovative Perspectives On Edge Domination Decomposition In Graphs. J Neonatal Surg [Internet]. 2025May15 [cited 2025Oct.17];14(24S):18-20. Available from: https://www.jneonatalsurg.com/index.php/jns/article/view/5877