collaborators

12 papers

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

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…

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