COMPLEMENTARY TREE PAIRED DOMINATION VERTEX CRITICAL GRAPHS
Annamalai Meenakshi, Jayapal Baskar Babujee · International Journal of Pure and Apllied Mathematics · 2016
A dominating set S ⊆ V is a paired dominating set if the induced sub graph S has a perfect matching.The minimum cardinality of a paired dominating set in G is called the paired domination number of G and is denoted by γpr(G).The graph G is paired domination vertex critical if for every vertex v of G that is not adjacent to a vertex of degree one, γpr(Gv) < γpr(G).If G is γpr-vertex critical and γpr(G) = k, then we say that G is kγpr-vertex critical.In this paper we introduce the concept complementary tree paired domination vertex critical graph and also we present some upper and lower bounds of it.Furthermore, we construct the complementary tree paired domination vertex critical graph.