On Ultra $k$-Secure Sets in Graphs

K Karthik, Chandru Hegde

In a graph $G=(V,E)$, let $S$ be a non empty subset of $V$. For any $x\in S$, the vertex $x$ and its neighbors inside $S$ are defenders of $x$, whereas those lying outside $S$ are…