Innovative Perspectives On Edge Domination Decomposition In Graphs
Keywords:
Decomposition, Edge Domination, Edge Dominating Set, Edge Domination NumberAbstract
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
Metrics
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
How to Cite
Issue
Section
License

This work is licensed under a Creative Commons Attribution 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
Terms:
- Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.