6 papers
Zeros of Ramanujan-Like Polynomials
Benjamin Fichter, Vishal Shah, Wiseley Wong
In this paper we study a naturally occurring variant of Ramanujan polynomials with a Bernoulli convolution structure, , related to the double Mordell-Tornheim series. In parti…
Extremal Graphs for a Spectral Inequality on Edge-Disjoint Spanning Trees
Sebastian M. Cioabă, Anthony Ostuni, Davin Park +3
Liu, Hong, Gu, and Lai proved if the second largest eigenvalue of the adjacency matrix of graph with minimum degree satisfies ,…
The Toughness of Kneser Graphs
Davin Park, Anthony Ostuni, Nathan Hayes +4
The \textit{toughness} of a graph is a measure of its connectivity that is closely related to Hamiltonicity. Brouwer proved the lower bound on the t…
The spectrum and toughness of regular graphs
Sebastian M. Cioabă, Wiseley Wong
In 1995, Brouwer proved that the toughness of a connected -regular graph is at least , where is the maximum absolute value of the non-trivial eigenvalues of .…
Edge-disjoint spanning trees and eigenvalues of regular graphs
Sebastian M. Cioabă, Wiseley Wong
Partially answering a question of Paul Seymour, we obtain a sufficient eigenvalue condition for the existence of edge-disjoint spanning trees in a regular graph, when $k\in \{2…
The graphs with all but two eigenvalues equal to
Sebastian M. Cioabă, Willem H. Haemers, Jason Vermette +1
We determine all graphs whose adjacency matrix has at most two eigenvalues (multiplicities included) different from and decide which of these graphs are determined by their…