Chromatic connected domination in graphs. (4th July 2019)

• Record Type: Journal Article
• Authors: Balamurugan, S.; Anitha, M.; Kalaiselvi, S.
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 22:Number 5(2019)
• Page Start: 753
• Page End: 760
• Publication Date: 2019-07-04
• Subjects: 05C69; Connected domination -- Chromatic connected domination -- Chromatic connected domination number; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2019.1681692
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: Let G = ( V, E ) be a undirected, finite, simple graph. A subset D of V is said to be dominating set if for every v in V – D there exists u in D such that u and v are adjacent. A dominating set D is said to be connected dominating set if < D > has connected. We introduce the concept of chromatic connected dominating set. A subset D of V is said to be chromatic connected dominating set if D is a connected dominating set and χ (< D >) = χ ( G ), where χ ( G ) is a chromatic number of G . The minimum cardinality of chromatic connected dominating set of a graph G is called a chromatic connected domination number and is denoted by γcc ( G ). We find the chromatic connected domination number for some standard graphs and characterize the graph for γcc ( G ) = 2.