Strong Efficient Edge Domination number of some graphs obtained by duplicating their elements

Authors

  • M.Annapoopathi, N.Meena

Abstract

Let  be a simple graph. A subset S of E(G) is a strong (weak) efficient edge dominating set of G if ?Ns[e] /em> S? = 1 for all e /em> E(G)(?Nw[e] /em> S? = 1 for all e /em> E(G)) where Ns(e) ={f / f /em> E(G) & deg f ? deg e}(Nw(e) ={f / f /em> E(G) & deg f ? deg e}) and Ns[e]=Ns(e) /em>{e}(Nw[e] = Nw(e) /em>{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  ( . In this paper, the strong efficient edge domination number of some graphs obtained by duplicating their elements is studied.

Downloads

Published

2020-12-30

How to Cite

M.Annapoopathi, N.Meena. (2020). Strong Efficient Edge Domination number of some graphs obtained by duplicating their elements. International Journal of Modern Agriculture, 9(4), 679 - 688. Retrieved from http://modern-journals.com/index.php/ijma/article/view/408

Issue

Section

Articles