Edge Domination Decomposition Number of Graphs
Summary
No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.
Summarise with VIRAT Free to try with your Science Catalogs account.Abstract
A decomposition { G 1 , G 2 ,…, G n } is referred to as an edge domination decomposition of a connected graph G if γ′( G j )= j , 1 ≤ j ≤ n where γ’ ( G j ) is termed as edge domination number (EDN) of G j . In this case, n is edge domination decomposition number (EDDN) of G, and it has been shown by π EDD ( G ). We present a finding about edge domination decomposition number of graphs in this work. We have also looked at certain constraints on edge domination decomposition number of graphs.
Fields of Study & Subjects
Advanced Graph Theory Research
Graph Labeling and Dimension Problems
Graph theory and applications
Publication details
- Journal / source
- CRC Press eBooks
- Pages
- 413–415
- Publication date
- 31 March 2026
- Language
- EN
- Document type
- Book chapter