Dheer Noal Desai

Dheer Noal Desai

Auto-generated profile, based on publicly available information

Dheer Noal Desai

University of Memphis (USA)

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 March 2022 in Linear Algebra and its Applications
Verified
Journal Article
Closed access
DDDheer Noal Desai
Dheer Noal Desai
KLKang Liying
Kang Liying
YLYongtao Li
Yongtao Li
ZNZhenyu Ni
Zhenyu Ni
MTMichael Tait
Michael Tait
JWJing Wang
Jing Wang

1 July 2024 in Combinatorial Theory
Verified
Journal Article
Open access
PDF file
SCSebastian Cioab
Sebastian Cioab
DDDheer Noal Desai
Dheer Noal Desai
MTMichael Tait
Michael Tait
In this paper, we study the maximum adjacency spectral radii of graphs of large order that do not contain an even cycle of given length. For \(n›k\), let \(S_{n,k}\) be the join of a clique on \(k\) vertices with an independent set of \(n-k\) vertices and denote by \(S_{n,k}^+\) the graph obtained from \(S_{n,k}\) by adding one edge. In 2010, Nikiforov conjectured that for \(n\) large enough, the \(C_{2k+2}\)-free graph of maximum spectral radius is \(S_{n,k}^+\) and that the \(\{C_{2k+1},C_{2k+2}\}\)-free graph of maximum spectral radius is \(S_{n,k}\). We solve this two-part conjecture.Mathematics Subject Classifications: 05C35, 05C50Keywords: Spectral Turán number, even-cycle problem, Brualdi-Solheid problem

8 June 2023 in The Electronic Journal of Linear Algebra
Verified
Journal Article
Open access
PDF file
AAAida Abiad
Aida Abiad
LLLeonardo De Lima
Leonardo De Lima
DDDheer Noal Desai
Dheer Noal Desai
KGKrystal Guo
Krystal Guo
LHLeslie Hogben
Leslie Hogben
JMJosé Madrid
José Madrid
The energy of a graph $G$ is the sum of the absolute values of the eigenvalues of the adjacency matrix of $G$. Let $s^+(G), s^-(G)$ denote the sum of the squares of the positive and negative eigenvalues of $G$, respectively. It was conjectured by [Elphick, Farber, Goldberg, Wocjan, Discrete Math. (2016)] that if $G$ is a connected graph of order $n$, then $s^+(G)\geq n-1$ and $s^-(G) \geq n-1$. In this paper, we show partial results towards this conjecture. In particular, numerous structural results that may help in proving the conjecture are derived, including the effect of various graph operations. These are then used to establish the conjecture for several graph classes, including graphs with certain fraction of positive eigenvalues and unicyclic graphs.

22 November 2023 in Linear Algebra and its Applications
Verified
Journal Article
Closed access
DDDheer Noal Desai
Dheer Noal Desai

9 March 2026 in Graphs and Combinatorics
Verified
Journal Article
Closed access
DDDheer Noal Desai
Dheer Noal Desai
RWRunze Wang
Runze Wang

24 August 2023 in arXiv
Verified
Preprint
Open access
PDF file
DDDheer Noal Desai
Dheer Noal Desai
Let $C_{2k_1, 2k_2, \ldots, 2k_t}$ denote the graph obtained by intersecting $t$ distinct even cycles $C_{2k_1}, C_{2k_2}, \ldots, C_{2k_t}$ at a unique vertex. In this paper, we determine the unique graphs with maximum adjacency spectral radius among all graphs on $n$ vertices that do not contain any $C_{2k_1, 2k_2, \ldots, 2k_t}$ as a subgraph, for $n$ sufficiently large. When one of the constituent even cycles is a $C_4$, our results improve upper bounds on the Turán numbers for intersecting even cycles that follow from more general results of Füredi [20] and Alon, Krivelevich and Sudakov [1]. Our results may be seen as extensions of previous results for spectral Turán problems on forbidden even cycles $C_{2k}, k\ge 2$ (see [8, 34, 44, 45]).