Shivaramakrishna Pragada

activity

20202026

most citedOn the construction of cospectral nonisomorphic bipartite graphs

5 citations · 5 across the 26 of their papers we have counts for

collaborators

Showing 2024Show all

4 papers · 1 filter

math.CO2024

A Linear Lower Bound for the Square Energy of Graphs

Saieed Akbari, Hitesh Kumar, Bojan Mohar +1

Let $G$ be a graph of order $n$ with eigenvalues $λ_{1} \geq \dots \geq λ_{n}$ . Let \[s^+(G)=\sum_{λ_i>0} λ_i^2, \qquad s^-(G)=\sum_{λ_i<0} λ_i^2.\] The smaller value, $s(G)=\min\{s^+(…

math.CO2024

On the second largest adjacency eigenvalue of trees with given diameter

Hitesh Kumar, Bojan Mohar, Shivaramakrishna Pragada +1

For a graph $G$ , let $λ_{2} (G)$ denote the second largest eigenvalue of the adjacency matrix of $G$ . We determine the extremal trees with maximum/minimum adjacency eigenvalue $λ_{2}$ i…

math.CO2024

Bollobás-Nikiforov Conjecture for graphs with not so many triangles

Hitesh Kumar, Shivaramakrishna Pragada

Bollobás and Nikiforov conjectured that for any graph $G \neq = K_{n}$ with $m$ edges \[ λ_1^2+λ_2^2\le \bigg( 1-\frac{1}{ω(G)}\bigg)2m\] where $λ_{1}$ and $λ_{2}$ denote the two largest e…

math.CO2024

Constructing cospectral graphs by unfolding non-bipartite graphs

M. Rajesh Kannan, Shivaramakrishna Pragada, Hitesh Wankhede

In 2010, Butler introduced the unfolding operation on a bipartite graph to produce two bipartite graphs, which are cospectral for the adjacency and the normalized Laplacian matrice…