CTATD Number for Power Graph of Some Special Graphs and Tadpole Graph

In this paper, initially Mahadevan et al. [4] studied CTATD number. A set \(S\subseteq V\) is called a complementary triple connected at most twin dominating set CTATD(G) if every vertex \(v\in V-S, ~1\le |N(v)\cap S|\le 2\) and \(<V-S>\) is triple connected. The smallest cardinality of CTATD-sets is called the CTATD number and is denoted by CTATD(G). In this work, in this article, we examine the CTATD number for the tadpole graph and some particular power graphs.