European Journal of Molecular & Clinical Medicine
2515-8260
7
6
2020
12
14
Prime Edge Domination number of Graphs
2630
2635
4089
EN
G. Kalaimurugan,
S. Magi
India
Journal Article
2020
12
14
In this paper, we introduce a new concept of edge domination graph named while relatively prime edge dominating set of a graph G. Let G (V, E) be a graph. For a set Dā² āE(G) is said to be relatively prime edge dominating set, if it is an edge dominating set with some two elements and for each pair of edge (e, f) ā Dā²(š®) such that (deg e, deg f) = 1 (where degree of edge d(e) = deg u + deg v-2, e(=uv) in E(G)) . The minimum cardinality of a relatively prime edge dominating set (rped-set) is called relatively prime domination number and it is denoted by šøšššš
ā² (G). In this paper, we compute about an edge dominating graph of relatively prime.
https://ejmcm.com/article_4089_df2841035af125495cd57a8e32ecaf57.pdf