Work

Second largest eigenvalue thresholds for the vertex-connectivity of regular graphs

Year: 2026

Type: preprint

Abstract: Let $λ_2(G)$ and $κ(G)$ denote the second largest adjacency eigenvalue and the vertex-connectivity of a graph $G$. For a non-complete $r$-regular graph $G$, Fiedler's inequality $λ_2(G)\ge r-κ(G)$ shows that $λ_2(G)

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2610.33064

Authors: O, Suil, Sui, Lukai

Institution: SUNY Korea

Language: English

Topic: Graph theory and applications

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

Funders: National Research Foundation of Korea, Ministry of Science and ICT, South Korea

Award: G6888046570

OpenAlex ID: W7223978658

Cites:

Cited by:

Related to: 10