More Results on Complementary Tree Domination Number of Semi Total Point Graph

Abstract

A set  of a graph  is a complementary tree dominating set if the induced subgraph  is a tree. The complementary tree domination number  is the minimum cardinality of a complementary tree dominating set (ctd-set) of G. The semi total point graph  is the graph G whose vertex set is . Where two vertices are adjacent if and only if (i) they are adjacent vertices of G or (ii) one is a vertex and the other is an edge of G incident with it. In this paper complementary tree domination number of semi total point graph of graphs, its bounds and relation between  and  are obtained.