DDDheer Noal Desai
Dheer Noal Desai
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Dheer Noal Desai has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Aida Abiad
Eindhoven University of Technology, Vrije Universiteit Brussel
2 shared publications - Anurag Sahay
Department of Mathematics, Purdue University, West Lafayette, USA
2 shared publications - Joshua Cooper
Department of Mathematics, University of South Carolina, Columbia, USA
2 shared publications - José Madrid
Université de Genève (Switzerland)
2 shared publications - Krystal Guo
Korteweg-De Vries institute University of Amsterdam Amsterdam The Netherlands
2 shared publications - Leonardo de Lima
Departamento de Administração Geral e Aplicada, Universidade Federal do Paraná, Brasil
2 shared publications
Latest Publications
- 22 June 2026
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 748, 184-226
A spectral Turán problem for a fixed tree
- 22 June 2026
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 748, 184-226
A spectral Turán problem for a fixed tree
- 9 March 2026
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 42 (2)
New Developments on Graph Sum Index
- 9 March 2026
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 42 (2)
New Developments on Graph Sum Index
- Open Access
Minimum spectral radius of graphs of fixed order and dissociation number and its connection to Turán problems
Let $\mathcal{D}_{n,τ}$ be the set of all simple connected graphs of order $n$ and dissociation number $τ.$ In this paper, we study the minimum size and the minimum spectral radius of graphs in $\mathcal{D}_{n,τ}$ in connection with Turán-type problems for complete multipartite graphs. We characterize the Tur\' an graphs for several complete multipartite graphs where the size of one of the partite sets is much smaller than the size of the remaining partites. This extends a result of Erdős and Simonovits [16]. Additionally, we prove some stability results to get the structure of graphs without such a forbidden complete multipartite subgraph, and close to Turán number of edges. As an application, we show that a graph with the minimum spectral radius in $\mathcal{D}_{n,τ}$ must be a graph with the minimum size in $\mathcal{D}_{n, τ}$ when $n$ is sufficiently large and satisfies some parity conditions. We then describe a few structural properties of graphs with the minimum spectral radius in $\mathcal{D}_{n,τ}$. For even dissociation numbers and any order $n$, we compute the minimum size of a graph in $\mathcal{D}_{n,τ}$ and use it to characterize the graphs in $\mathcal{D}_{n, 4}$ that attain the minimum size and the minimum spectral radius. We also apply the stability results to upper bound the minimum number of edges and spectral radius for connected graphs with a given $d$-independence number when the order of the graph is sufficiently large. Finally, we derive two new bounds on the value of $τ(G)$ for a given graph $G$.Open AccessMinimum spectral radius of graphs of fixed order and dissociation number and its connection to Turán problems
Let $\mathcal{D}_{n,τ}$ be the set of all simple connected graphs of order $n$ and dissociation number $τ.$ In this paper, we study the minimum size and the minimum spectral radius of graphs in $\mathcal{D}_{n,τ}$ in connection with Turán-type problems for complete multipartite graphs. We characterize the Tur\' an graphs for several complete multipartite graphs where the size of one of the partite sets is much smaller than the size of the remaining partites. This extends a result of Erdős and Simonovits [16]. Additionally, we prove some stability results to get the structure of graphs without such a forbidden complete multipartite subgraph, and close to Turán number of edges. As an application, we show that a graph with the minimum spectral radius in $\mathcal{D}_{n,τ}$ must be a graph with the minimum size in $\mathcal{D}_{n, τ}$ when $n$ is sufficiently large and satisfies some parity conditions. We then describe a few structural properties of graphs with the minimum spectral radius in $\mathcal{D}_{n,τ}$. For even dissociation numbers and any order $n$, we compute the minimum size of a graph in $\mathcal{D}_{n,τ}$ and use it to characterize the graphs in $\mathcal{D}_{n, 4}$ that attain the minimum size and the minimum spectral radius. We also apply the stability results to upper bound the minimum number of edges and spectral radius for connected graphs with a given $d$-independence number when the order of the graph is sufficiently large. Finally, we derive two new bounds on the value of $τ(G)$ for a given graph $G$. - Open Access
A Spectral Turán Problem for a Fixed Tree
We study the spectral Turán problem for trees. To avoid limiting our perspective to specific families of trees, we parametrize trees in terms of their unique bipartition. We say $T \in \mathcal{T}_{m,l+1}^δ$ if $T$ is a tree of order $m$, where the order of the smaller partite set $A$ of $T$ is $l+1$, and $δ$ is the minimum degree of the vertices in $A$. The motivation for this parametrization comes from the recent proof of the spectral Erdős-Sós conjecture. For a given fixed tree $T$, we describe $\mathrm{SPEX}(n,T)$ and consequently, bound $\mathrm{spex}(n,T)$ in terms of $m,l,δ$ for that tree. Our approach combines spectral arguments with new results and constructions on embedding a tree $T \in \mathcal{T}_{m,l+1}^δ$ into graphs of the form $\overline{K}_l \vee m S_δ$. We give bounds on $\mathrm{spex}(n,T)$ within an error of $Θ(n^{-1/2})$ and $Θ(n^{-1})$ that are based on our embedding results for the given $T$.Open AccessA Spectral Turán Problem for a Fixed Tree
We study the spectral Turán problem for trees. To avoid limiting our perspective to specific families of trees, we parametrize trees in terms of their unique bipartition. We say $T \in \mathcal{T}_{m,l+1}^δ$ if $T$ is a tree of order $m$, where the order of the smaller partite set $A$ of $T$ is $l+1$, and $δ$ is the minimum degree of the vertices in $A$. The motivation for this parametrization comes from the recent proof of the spectral Erdős-Sós conjecture. For a given fixed tree $T$, we describe $\mathrm{SPEX}(n,T)$ and consequently, bound $\mathrm{spex}(n,T)$ in terms of $m,l,δ$ for that tree. Our approach combines spectral arguments with new results and constructions on embedding a tree $T \in \mathcal{T}_{m,l+1}^δ$ into graphs of the form $\overline{K}_l \vee m S_δ$. We give bounds on $\mathrm{spex}(n,T)$ within an error of $Θ(n^{-1/2})$ and $Θ(n^{-1})$ that are based on our embedding results for the given $T$. - Open Access
- 23 October 2024
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- Vol. 40, 697-713
Principal eigenvectors in hypergraph Turán problems
For a general class of hypergraph Turán problems with uniformity $r$, we investigate the principal eigenvector for the $p$-spectral radius (in the sense of Keevash-Lenz-Mubayi and Nikiforov) for the extremal graphs, showing in a strong sense that these eigenvectors have close to equal weight on each vertex (equivalently, showing that the principal ratio is close to $1$). We investigate the sharpness of our result; it is likely sharp for the Turán tetrahedron problem. In the course of this latter discussion, we establish a lower bound on the $p$-spectral radius of an arbitrary $r$-graph in terms of the degrees of the graph. This builds on earlier work of Cardoso-Trevisan, Li-Zhou-Bu, Cioabă-Gregory, and Zhang. The case $1 < p < r$ of our results leads to some subtleties connected to Nikiforov's notion of $k$-tightness, arising from the Perron-Frobenius theory for the $p$-spectral radius. We raise a conjecture about these issues and provide some preliminary evidence for our conjecture.- 23 October 2024
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- Vol. 40, 697-713
Open AccessPrincipal eigenvectors in hypergraph Turán problems
For a general class of hypergraph Turán problems with uniformity $r$, we investigate the principal eigenvector for the $p$-spectral radius (in the sense of Keevash-Lenz-Mubayi and Nikiforov) for the extremal graphs, showing in a strong sense that these eigenvectors have close to equal weight on each vertex (equivalently, showing that the principal ratio is close to $1$). We investigate the sharpness of our result; it is likely sharp for the Turán tetrahedron problem. In the course of this latter discussion, we establish a lower bound on the $p$-spectral radius of an arbitrary $r$-graph in terms of the degrees of the graph. This builds on earlier work of Cardoso-Trevisan, Li-Zhou-Bu, Cioabă-Gregory, and Zhang. The case $1 < p < r$ of our results leads to some subtleties connected to Nikiforov's notion of $k$-tightness, arising from the Perron-Frobenius theory for the $p$-spectral radius. We raise a conjecture about these issues and provide some preliminary evidence for our conjecture. - Open Access
- 1 July 2024
- Published by California Digital Library (CDL) in Combinatorial Theory
- Vol. 4 (1)
The spectral even cycle problem
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- 1 July 2024
- Published by California Digital Library (CDL) in Combinatorial Theory
- Vol. 4 (1)
Open AccessThe spectral even cycle problem
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 - Open Access
Principal eigenvectors and principal ratios in hypergraph Turán problems
For a general class of hypergraph Turán problems with uniformity $r$, we investigate the principal eigenvector for the $p$-spectral radius (in the sense of Keevash--Lenz--Mubayi and Nikiforov) for the extremal graphs, showing in a strong sense that these eigenvectors have close to equal weight on each vertex (equivalently, showing that the principal ratio is close to $1$). We investigate the sharpness of our result; it is likely sharp for the Turán tetrahedron problem. In the course of this latter discussion, we establish a lower bound on the $p$-spectral radius of an arbitrary $r$-graph in terms of the degrees of the graph. This builds on earlier work of Cardoso--Trevisan, Li--Zhou--Bu, Cioabă--Gregory, and Zhang. The case $1 < p < r$ of our results leads to some subtleties connected to Nikiforov's notion of $k$-tightness, arising from the Perron-Frobenius theory for the $p$-spectral radius. We raise a conjecture about these issues, and provide some preliminary evidence for our conjecture.Open AccessPrincipal eigenvectors and principal ratios in hypergraph Turán problems
For a general class of hypergraph Turán problems with uniformity $r$, we investigate the principal eigenvector for the $p$-spectral radius (in the sense of Keevash--Lenz--Mubayi and Nikiforov) for the extremal graphs, showing in a strong sense that these eigenvectors have close to equal weight on each vertex (equivalently, showing that the principal ratio is close to $1$). We investigate the sharpness of our result; it is likely sharp for the Turán tetrahedron problem. In the course of this latter discussion, we establish a lower bound on the $p$-spectral radius of an arbitrary $r$-graph in terms of the degrees of the graph. This builds on earlier work of Cardoso--Trevisan, Li--Zhou--Bu, Cioabă--Gregory, and Zhang. The case $1 < p < r$ of our results leads to some subtleties connected to Nikiforov's notion of $k$-tightness, arising from the Perron-Frobenius theory for the $p$-spectral radius. We raise a conjecture about these issues, and provide some preliminary evidence for our conjecture. - 22 November 2023
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 683, 46-70
Spectral Turán problems for intersecting even cycles
- 22 November 2023
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 683, 46-70
Spectral Turán problems for intersecting even cycles
- Open Access
Spectral Turán problems for intersecting even cycles
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]).Open AccessSpectral Turán problems for intersecting even cycles
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]). - Open Access
- 8 June 2023
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- Vol. 39, 307-326
Positive and negative square energies of graphs
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.- 8 June 2023
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- Vol. 39, 307-326
Open AccessPositive and negative square energies of graphs
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.