Rahul Roy

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2026

The Equality Case in the Positive Square-Energy Strengthening of Turán's Theorem

Abhay Jayarajan, M. Rajesh Kannan, Shivaramakrishna Pragada +1

Let $G$ be a graph of order $n$ with eigenvalues $λ_{1} (G) \geq \dots \geq λ_{n} (G)$ , and let $s_{+} (G) = \sum_{λ_{i} (G) > 0} λ_{i} (G)^{2} .$ Recently Liu, Tang, and Zhang proved the positive square…

math.CO2026

Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov

Sebastian M. Cioabă, Abhay Jayarajan, M. Rajesh Kannan +1

The algebraic connectivity of a graph $G$ is a well-studied graph invariant that is related to other properties of the graph such as connectivity and expansion. Given $n$ and $m$ ,…

math.CO2026

Structural and extremal properties of $l_{1}$ -Fiedler value

M. Rajesh Kannan, Rahul Roy

The algebraic connectivity $a (G)$ , defined as the second smallest eigenvalue of the Laplacian matrix $L (G)$ , admits a well-known variational characterization involving the minimiza…

math.CO2025

On the $l_{\infty}$ -analog of Algebraic Connectivity

M. Rajesh Kannan, Rahul Roy

The algebraic connectivity of a graph, defined as the second smallest eigenvalue of its Laplacian matrix, admits a well-known variational characterization involving the $ℓ_{2}$ -no…

The Equality Case in the Positive Square-Energy Strengthening of Turán's Theorem

Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov

Structural and extremal properties of l1​-Fiedler value

On the l∞​-analog of Algebraic Connectivity

Structural and extremal properties of $l_{1}$ -Fiedler value

On the $l_{\infty}$ -analog of Algebraic Connectivity