The concept of the CTATD number has been recently further developed, expanding on the original work by Mahadevan, Priya, and Sivagnanam [4]. A subset S ⊆ V is considered a CTATD set for a graph G if for each vertex v ∈ V – S, the intersection of v’s neighborhood with S contains between one and two vertices, and for any set of three vertices in , they must be connected along a path. The smallest size of such a CTATD set is referred to as CTATD(G). This paper specifically focuses on analyzing the CTATD number for various types of graphs, including DLl, O(DLl), TLl, O(TLl), SLl, CLl, MLl, providing explicit values for their CTATD numbers instead of just their bounds.