Complementary Tree Nil Domination Number of a Graph
Journal Title: International Journal of Engineering Science, Advanced Computing and Bio-Technology - Year 2017, Vol 8, Issue 1
Abstract
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 of a connected graph G is called a complementary tree nil dominating set if the induced sub graph <V-D> is a tree and V-D is not a dominating set . The minimum cardinality of a complementary tree nil dominating set is called the complementary tree nil domination number of G and is denoted by ctnd(G). In this paper, bounds for ctnd(G) and its exact values for some particular classes of graphs are found. Some results on complementary tree nil domination number are also established.
Authors and Affiliations
Muthammai S, Ananthavalli G
Keywords
Related Articles
- EP ID EP451633
- DOI 10.26674/ijesacbt/2017/49169
- Views 103
- Downloads 0
Further Results on Chromatic Number with Complementary Connected Perfect Domination Number of a Graph
The concept of Complementary connected perfect domination number was introduced by G.Mahadevan et.alc., in [5]. A subset S of V of a non trivial graph G is said to be complementary connected perfect dominating set if S i...
Complementary Tree Nil Domination Number of a Graph
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 of a connecte...