S. Muthammai

  • Citations Per Year
Learn More
A set D of a graph G = (V,E) is a dominating set, if every vertex in V (G) − 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 nil dominating set, if V (G)−D is not a dominating set and also the induced subgraph 〈V (G)−D〉 is a tree. The minimum(More)
A set D  V of a graph G = (V, E) is a dominating set, if every vertex in V(G)  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 of a connected graph G is called a complementary tree nil dominating set if the induced subgraph < V (G)  D > is a tree and V(G)  D is not a(More)
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 subgraph < V −D > is a tree. The minimum cardinality of a complementary tree dominating set(More)
  • 1