• Sana Aejaz
• Jyoti SIngh Raghav
• D.G.Akka

In this paper, we initiate the study of set-domination in line graph L(G) of a graph G.The line graph L(G) of a graph G is the graph whose vertex set is in one-to-one correspondence with the elements of the set E such that two vertices of L(G) are adjacent if and only if they correspond to two adjacent edge of G. In this paper, many bounds of γ_sd [L(G)] were obtained. Also its exact values for some standard graphs were found.

Line Graph, Set-domination, co-total domination, perfect domination, total domination.

"Set Domination in Line Graph", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.9, Issue 7, page no.h108-h115, July-2022, Available :http://www.jetir.org/papers/JETIR2207717.pdf

"Set Domination in Line Graph", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.9, Issue 7, page no. pph108-h115, July-2022, Available at : http://www.jetir.org/papers/JETIR2207717.pdf