• Jyoti Rani
• Prateek Mor

Let G = (V, E) be a simple graph of order n. The total dominating set S of V that every vertex of V ( including those in the set itself ) is adjacent to some vertices of S. A total dominating set S of G is called a pendant total dominating set if the induced sub graph <S> contains at least one pendant vertex. In this paper, we introduce a new type of graph polynomial called pendant total domination polynomial. We obtain the pendant total domination polynomial of some standard graphs.

Total dominating sets, Pendant total dominating set, Total domination polynomial, Pendant total domination polynomial.

"Pendant Total Domination Polynomial Of Some Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 3, page no.446-449, March-2019, Available :http://www.jetir.org/papers/JETIR1903I66.pdf

"Pendant Total Domination Polynomial Of Some Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 3, page no. pp446-449, March-2019, Available at : http://www.jetir.org/papers/JETIR1903I66.pdf