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

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

Abstract

Abstract: Let G = ( V, E ) be a simple, finite and undirected graph and without isolated vertex. A set D ⊆ V is said to be chromatic total dominating set of G if D is a total dominating set and χ (< D >) = χ ( G ). The minimum cardinality of a chromatic total dominating set of G is called the chromatic total domination number of G and is denoted by γ t ch ( G ). In this paper, we discuss the chromatic total domination number for standard graphs.