5 citations · 5 across the 26 of their papers we have counts for
12 papers · 1 filter
The switching conjecture for main eigenvalues is asymptotically true
Saieed Akbari, Hitesh Kumar, Bojan Mohar +1
An eigenvalue of a signed graph is called \emph{main} if there exists a corresponding eigenvector non-orthogonal to the all-ones vector. An important result of O'Rourke and Touri (…
A Vertex-Localized Positive Square-Energy Strengthening of Turán's Theorem
Abhay Jayarajan, M. Rajesh Kannan, Shivaramakrishna Pragada +1
Let be a graph of order with the adjacency eigenvalues . Let denote the maximum order of a clique containing vertex . We prove the…
Resolution of a problem of Mohar on non-positive inertia
Clive Elphick, Hitesh Kumar, Shivaramakrishna Pragada +1
For a graph of order , its positive, negative and non-positive inertia is the number of positive, negative and non-positive eigenvalues of its adjacency matrix , respe…
Stability of maximal relative projection constants
Hitesh Kumar, Bojan Mohar, Seyed Ahmad Mojallal +1
For positive integers , let denote the \emph{maximal relative projection constant} of -dimensional subspaces of and denote the \emph{maxi…
Localization of the Caro-Wei bound and its applications to bipartiteness
Aida Abiad, Hitesh Kumar, Shivaramakrishna Pragada
We confirm a conjecture of Brause, Randerath, Rautenbach and Schiermeyer (2016) by proving a localized lower bound on the independence number of a graph that strengthens the classi…
Extremal graphs for the -th eigenvalue
Hitesh Kumar, Bojan Mohar, Seyed Ahmad Mojallal +1
For a simple graph of order , let denote its adjacency eigenvalues. Hong's problem asks for the optimal upper bound for . A recent theo…
Energy and independence number
Hitesh Kumar, Shivaramakrishna Pragada
For a graph of order , with adjacency eigenvalues , the \emph{energy} of is defined to be \[\mathcal{E}(G)=\sum_{i=1}^{n} |λ_i(G)|.\] A w…
An improved bound for the strong clique index of graphs
Hitesh Kumar, Bojan Mohar, Shivaramakrishna Pragada
For a graph with line graph , and are called the \emph{strong chromatic index} and \emph{strong clique index} of , respectively. A well-known c…
Spectral Radius, Vertex Deletion, and Chromatic Number of Signed Graphs
Abhay Jayarajan, M. Rajesh Kannan, Priti Prasanna Mondal +1
A signed graph is a graph with edges given signs or defined by the function . The adjacency matrix of is defined as per these signs. The relation betw…
Localized Turán-type inequalities for -index
M. Rajesh Kannan, Hitesh Kumar, Shivaramakrishna Pragada
For a connected graph \(G\), let denote the -index of , i.e., the largest eigenvalue of its signless Laplacian matrix. Abreu and Nikiforov (2013) showed that \[ q(G) \…
Maximum spectral sum of graphs
Hitesh Kumar, Lele Liu, Hermie Monterde +2
For a graph of order , the spectral sum of is defined to be the sum , where (resp. ) is the largest (resp. second largest) adjacency ei…
Convex combination of first and second eigenvalues of trees
Hitesh Kumar, Bojan Mohar, Shivaramakrishna Pragada +1
For a graph , let and denote the largest and the second largest adjacency eigenvalue of . The sum is called the \emph{spectral sum} of …