Split domination number of divisible dominating graphs. (19th May 2021)

• Record Type: Journal Article
• Authors: Amutha, S.; Suriya Prabha, K.; Anbazhagan, N.; Shanthi, P.
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 24:Number 4(2021)
• Page Start: 997
• Page End: 1006
• Publication Date: 2021-05-19
• Subjects: 05C69; Dominating set -- Split dominating set -- Split domination number -- Divisible dominating graph; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2020.1744813
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: A graph G is a divisible dominating graph if the vertices are labeled with positive integers d and n except 0, such that the vertex labeled with n is adjacent to the vertex named with d if and only if d | n . In this paper, we introduce the concept of some special classes of divisible dominating graphs and we investigate the split domination number of such graphs.