Work

Spectral gap of G(n,αn,α2n) graphs and the giant component theorem

Year: 2026

Type: article

Abstract: The spectrum of a graph G is the set of the eigenvalues of its adjacency matrix. It turns out that one can say a lot about a graph with the only knowledge being the spectrum of this graph. In this paper we obtain new results about the spectrum of G ( n , α n , α 2 n ) graphs. We then apply these results to get a giant component theorem for them.

Source: Discrete Applied Mathematics

DOI: 10.1016/j.dam.2026.10.025

Authors: M. Koshelev, A. Raigorodskii

Institutions: Moscow Institute of Physics and Technology, Lomonosov Moscow State University, Adyghe State University, Buryat State University

Language: English

Topic: Limits and Structures in Graph Theory

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,090

Funders: Ministry of Science and Higher Education of the Russian Federation, Foundation for the Advancement of Theoretical Physics and Mathematics