Split domination number of divisible dominating graphs
S. Amutha, K. Suriya Prabha, Neelamegam Anbazhagan, P. Shanthi · Journal of Discrete Mathematical Sciences and Cryptography · 2020
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.