N. Sadagopan

collaborators

2 papers

cs.DM2025

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) ∖ S$ is adjacent to a vertex $v \in S$ such that $(S \setminu…

cs.DS2014

Some Combinatorial Problems on Halin Graphs

M. Kavin, K. Keerthana, N. Sadagopan +2

Let $T$ be a tree with no degree 2 vertices and $L (T) = {l_{1}, \dots, l_{r}}, r \geq 2$ denote the set of leaves in $T$ . An Halin graph $G$ is a graph obtained from $T$ such that $V(G)…