activity
20242026
collaborators
Showing 2026Show all

11 papers · 1 filter

math.CO2026

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 (…

math.CO2026

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…

math.FA2026

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…

math.CO2026

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…

math.CO2026

A proof of the cyclotomic conjecture and the non-existence of almost Moore digraphs

Jaskaran Kaur, Hitesh Kumar

For and , define the polynomial \[F_{n,k}(x) = Φ_n(1 + x + \cdots + x^k),\] where denotes the -th cyclotomic polynomial. The \emph{cyclotomic conjecture} propos…

math.CO2026

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…

math.CO2026

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…

math.CO2026

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…

math.CO2026

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) \…

math.CO2026

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…

math.CO2026

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 …