• ABDUL MAJEED

A set of edges F⊆E[S(B(G))] is called an edge dominating set of subdivision of block graph of G, if every edge in E-F is adjacent to at least one edge in F. The edge domination number of a graph S(B(G)) is denoted by γ' [S(B(G))], is the minimum cardinality of an edge dominating set of S(B(G)). In this paper, we obtain many bonds on γ' [S(B(G))], in terms of vertices, edges, blocks and different parameters of G and not the members of S(B(G)). Further we determine its relationship with other domination parameters.

Block graph,Subdivision graph, Edge domination number

"Edge domination in subdivision of Block graphs of Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 4, page no.218-219, April-2019, Available :http://www.jetir.org/papers/JETIR1904M35.pdf

"Edge domination in subdivision of Block graphs of Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 4, page no. pp218-219, April-2019, Available at : http://www.jetir.org/papers/JETIR1904M35.pdf