Secure Domination in Bisplit graphs -- A Structural and algorithmic study

Swathi D, N Sadagopan

A dominating set $S$ of a graph $G(V,E)$ is called a \textit{secure dominating set} if each vertex $u\in V(G)\setminus S$ is adjacent to a vertex $v\in S$ such that $(S \setminu…