• P. Vidhya

A set D of a graph G = (V,E) is a dominating set if every vertex in V −D is adjacent to some vertex in D. The domination number γ(G) of G is the minimum cardinality of a dominating set. A dominating set D is called a complementary tree dominating set if the induced sub graph < V −D > is a tree. The minimum cardinality of a complementary tree dominating set is called the complementary tree domination number of G and is denoted by γctd(G). In this paper, results on complementary tree domination number , total complementary tree domination number and connected complementary tree in Jahangir graph J2,m are found

Complementary tree domination number, total, connected complementary tree domination number, Jahangir graphs

"Complementary Tree Domination in Jahangir Graph J", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 1, page no.12-16, January-2019, Available :http://www.jetir.org/papers/JETIRR006002.pdf

"Complementary Tree Domination in Jahangir Graph J", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 1, page no. pp12-16, January-2019, Available at : http://www.jetir.org/papers/JETIRR006002.pdf