5 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…
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 $…
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…
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 radi…
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…