Split bondage numbers of a graph
The paper studies numerical invariants of a graph which are closely related to the split domination number. A subset \(D\) of the vertex set of a graph \(G\) is called dominating in \(G\), if each vertex of \(G\) either is in \(D\), or is adjacent to a vertex of \(D\). A dominating set \(D\) in \(G\) is called a split dominating set in \(G\), if the subgraph of \(G\) induced by \(D\) is disconnected. The minimum number of vertices of a split dominating set in \(G\) is the split domination number \(\gamma_s(G)\) of \(G\). The negative split bondage number \(b_s^-(G)\) (or the split bondage number \(b_s(G))\) of \(G\) is the minimum cardinality of a subset \(X\) of the edge set of \(G\) with the property that \(\gamma_s (G-X)< \gamma_s(G)\) (or \(\gamma_s(G-X) >\gamma_s(G)\) respectively). Some inequalities for these numerical invariants and their exact values for some standard graphs are obtained.
This page was built for publication: Split bondage numbers of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4223767)
