• M. Annapoopathi
• M. Annapoopathi
• N. Meena

Let G=(V,E) be a simple graph. A subset S of E(G) is a strong (weak) efficient edge dominating set of G if │Ns[e]  S│ = 1 for all e  E(G) (│Nw[e]  S│ = 1 for all e  E(G)) where Ns(e) ={f / f  E(G) & deg f ≥ deg e}(Nw (e) ={f / f  E(G) & deg f ≤ deg e}) & Ns[e]=Ns(e){e}(Nw[e]=Nw (e){e}). The minimum cardinality of a strong efficient edge dominating set of G (weak efficient edge dominating set of G) is called a strong efficient edge domination number of G and is denoted by se(G)( we(G)). In this paper, the strong efficient edge domination number of some corona related graphs is studied

Domination, edge domination, strong edge domination, efficient edge domination, strong efficient edge domination.

"Strong Efficient Edge Domination Number of Some Corona Related Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 2, page no.778-787, February-2019, Available :http://www.jetir.org/papers/JETIRAB06148.pdf

"Strong Efficient Edge Domination Number of Some Corona Related Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 2, page no. pp778-787, February-2019, Available at : http://www.jetir.org/papers/JETIRAB06148.pdf