B. Rakshith

collaborators

2 papers

math.CO2026

Secure coalitions in graphs

Swathi Shetty, Sayinath Udupa N. V., B. R. Rakshith

A secure coalition in a graph $G$ consists of two disjoint vertex sets $V_{1}$ and $V_{2}$ , neither of which is a secure dominating set, but whose union $V_{1} \cup V_{2}$ forms a secure d…

math.CO2025

On Coalition Graphs and Coalition Count of Graphs

Swathi Shetty, Sayinath Udupa N. V., B. R. Rakshith

Let $G$ be graph with vertex set $V (G)$ and order $n$ . A coalition in a graph $G$ consists of two disjoint sets of vertices $V_{1}$ and $V_{2}$ , neither of which is a dominating set bu…