1. TOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS

S. Alikhani; N. Jafari

Volume 5, Issue 2 , Winter and Spring 2018, , Pages 127-138

Abstract
  Let $G = (V, E)$ be a simple graph of order $n$. The total dominating set is a subset $D$ of $V$ that every vertex of $V$ is adjacent to some vertices of $D$. The total domination number of $G$ is equal to minimum cardinality of total dominating set in $G$ and denoted by $\gamma_t(G)$. The total domination ...  Read More