B. Rakshith

collaborators

Showing math.COShow all

5 papers · 1 filter

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…

math.CO2024

On the $A BS$ spectrum and energy of graphs

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

Let $I^\cdot_{1} \geq I^\cdot_{2} \geq \dots \geq I^\cdot_{n}$ be the eigenavalues of $A BS$ matrix. In this paper, we characterize connected graphs with $A BS$ eigenvalue $I^\cdot_{n} > - 1$ …

math.CO2024

Bounds on the Inverse symmetric division deg index and the relation with other topological indices of graphs

Kinkar Chandra Das, B. R. Rakshith, Wojciech Macek

Let $G = (V, E)$ be a simple graph. The concept of Inverse symmetric division deg index $(I S D D)$ was introduced in the chemical graph theory very recently. In spite of this, a few pap…

math.CO2024

On Energy of Graphs with Self-Loops

B. R. Rakshith, Kinkar Chandra Das, B. J. Manjunatha

Let G be a simple graph on n vertices with vertex set V(G). The energy of G, denoted by, $E (G)$ is the sum of all absolute values of the eigenvalues of the adjacency matr…

Secure coalitions in graphs

On Coalition Graphs and Coalition Count of Graphs

On the ABS spectrum and energy of graphs

Bounds on the Inverse symmetric division deg index and the relation with other topological indices of graphs

On Energy of Graphs with Self-Loops

On the $A BS$ spectrum and energy of graphs