Total Domination Number of Generalized Petersen Graphs P(ck,k)
Wensheng Li, Fengjun Liu, Liqiang Fan, Wei Chen & Jie Fang · Journal of Advances in Mathematics and Computer Science · 2016
A set S of vertices of a graph G = (V, E) with no isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex in S. The total domination number is the minimum cardinality of a total dominating set of G. In this paper, we study the total domination...
Open access
Research Article
10.9734/BJMCS/2016/27588