Michael Tait

activity

20242026

collaborators

Showing 2026Show all

2 papers · 1 filter

math.CO2026

Connected graphs with minimum adjacency spectral gap

Lele Liu, Michael Tait, Yi Wang

Let $G$ be a connected graph, and let $λ_{1} (G) > λ_{2} (G)$ denote its two largest adjacency eigenvalues. The spectral gap of $G$ is defined as the difference $λ_{1} (G) - λ_{2} (G)$ . For in…

math.CO2026

Maximum spectral sum of graphs

Hitesh Kumar, Lele Liu, Hermie Monterde +2

For a graph $G$ of order $n$ , the spectral sum of $G$ is defined to be the sum $λ_{1} (G) + λ_{2} (G)$ , where $λ_{1} (G)$ (resp. $λ_{2} (G)$ ) is the largest (resp. second largest) adjacency ei…