5 citations · 10 across the 10 of their papers we have counts for
12 papers
Intersecting Families of Spanning Trees of
Gordian C. Bruns, Dheer Noal Desai, Alexander L. Gavrilyuk +2
A family of spanning trees of a graph is -intersecting if any pair of spanning trees in the family has or more edges in common. For sufficiently large and $t \leq n/C\lo…
Minimum spectral radius of graphs of fixed order and dissociation number and its connection to Turán problems
Dheer Noal Desai, Vishal Gupta
Let be the set of all simple connected graphs of order and dissociation number In this paper, we study the minimum size and the minimum spectral radius…
A Spectral Turán Problem for a Fixed Tree
Dheer Noal Desai, Hemanshu Kaul, Bahareh Kudarzi
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…
New developments on graph sum index
Dheer Noal Desai, Runze Wang
In a graph, we assign distinct integers to the vertices, and take the sum of two integers if they are on two adjacent vertices. The minimum possible number of different sums is the…
Principal eigenvectors and principal ratios in hypergraph Turán problems
Joshua Cooper, Dheer Noal Desai, Anurag Sahay
For a general class of hypergraph Turán problems with uniformity , we investigate the principal eigenvector for the -spectral radius (in the sense of Keevash--Lenz--Mubayi an…
A general theorem in spectral extremal graph theory
John Byrne, Dheer Noal Desai, Michael Tait
The extremal graphs and spectral extremal graphs are the sets of graphs on vertices with maximum number of edges and m…
Positive and Negative Square Energies of Graphs
Aida Abiad, Leonardo de Lima, Dheer Noal Desai +3
The energy of a graph is the sum of the absolute values of the eigenvalues of the adjacency matrix of . Let denote the sum of the squares of the positive an…
A spectral Erdős-Sós theorem
Sebastian Cioabă, Dheer Noal Desai, Michael Tait
The famous Erdős-Sós conjecture states that every graph of average degree more than must contain every tree on vertices. In this paper, we study a spectral version of t…
The spectral even cycle problem
Sebastian Cioabă, Dheer Noal Desai, 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 , let be the join of a c…
Spectral extremal graphs for intersecting cliques
Dheer Noal Desai, Liying Kang, Yongtao Li +3
The -fan is the graph consisting of copies of the complete graph which intersect in a single vertex, and is denoted by . Erdős, Füredi, Gould and Gunderso…
The spectral radius of graphs with no odd wheels
Sebastian Cioabă, Dheer Noal Desai, Michael Tait
The odd wheel is the graph formed by joining a vertex to a cycle of length . In this paper, we investigate the largest value of the spectral radius of the adjacency…
Center, centroid and subtree core of trees
Dheer Noal Sunil Desai, Kamal Lochan Patra
For and consider the tree on vertices which is obtained by adding pendant vertices to one degree vertex of the path .…