Total Domination Polynomial of A Graph

Abstract

A total domination polynomial of a graph $G$ of order $n$ is the polynomial $D_{td}(G,x) =\sum^n_{t=\gamma_{td}(G)}d_{td}(G,t)x^t$, where $d_{td}(G,t)$ is the number of total dominating sets of $G$ of cardinality $t$. In this paper, we present various properties of total domination polynomial of graph $G$. Also determine the total domination polynomial of some graph operations.