Further Results on Chromatic Number with Complementary Connected Perfect Domination Number of a Graph
Journal Title: International Journal of Engineering Science, Advanced Computing and Bio-Technology - Year 2017, Vol 8, Issue 1
Abstract
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 is a dominating and is connected and has a perfect matching. The minimum cardinality taken over all complementary connected perfect dominating sets in G (CCPD-set) is called the complementary connected perfect domination number of G and is denoted by ccp . In [6, the authors already characterized the extremal graphs whose sum of complementary connected domination number and chromatic number upto 2n-5. Since the characterization of extremal graphs whose sum of complementary connected domination number and chromatic number equals to 2n-6 for any n > 3
Authors and Affiliations
Mahadevan G, Iravithul Basira A, Sivagnanam C
Keywords
Related Articles
- EP ID EP471473
- DOI 10.26674/ijesacbt/2017/49170
- Views 66
- 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...