Domination integrity of splitting graph of path and cycle

From MaRDI portal





Summary: If \(S\) is a dominating set of a connected graph \(G\) then the domination integrity is the minimum of the sum of two parameters, the number of elements in \(S\) and the order of the maximum component of \(G - S\). We investigate domination integrity of splitting graph of path \(P_n\) and cycle \(C_n\). This work is an effort to relate network expansion and vulnerability parameter.











This page was built for publication: Domination integrity of splitting graph of path and cycle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1952732)