Pendant Domination of Line Graph of N - Sunlet Graph

Abstract

The Line graph of a graph  is a graph in which the vertices are correspond to the edges of  and any two vertices are adjacent if and only if the corresponding edges of  are incident with same vertex of . Let  be any graph. A dominating set  in  is said to be a pendant dominating set if induced sub graph of   contains at least one pendant vertex. The least cardinality of a pendant dominating set in  is said to be a pendant domination number of and is denoted by  In this article, we determine the pendant domination number and split pendant domination number of line graph of