Split domination number of divisible dominating graphs

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...