Split domination number of k - Duplication of outer planar graphs
Muthukumar Priyadharshini, N. Parvathi · AIP conference proceedings · 2019
A dominating set whose deletion disconnects the graph is called a split dominating set S. The number of elements in a minimum S set is called the split domination number of the graph G and is denoted as γ(G). A graph is called outer planar if it can be embedded in a planar form such that all the vertices are in the outer face. In this paper, we established the split domination number of outer planar graphs.