Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
Split domination was introduced by Kulli and Janakiram. Let G be a graph with V as the vertex set and E as the edge set. Assume D is the subset. If the induced sub graph < V - D > is disconnected, the dominating set D of graph G is called a split dominating set. The split dominating number γS(G) is the minimum cardinality of the split dominating set. Split domination number γS(G) of G is the minimum cardinality over all the split dominating set in a graph G. In this paper we discussed about different types of the split domination graphs such as Ladder graph (Ln), Gear graph (Gn), Helm graph (Hn), Kronecker product of ladder graph, Kronecker product of ladder and gear graph, Kronecker product of diamond and bull graph.