Spectral gap of G(n,αn,α2n) graphs and the giant component theorem
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.
Authors
- Mikhail Koshelev (ORCID: https://orcid.org/0000-0002-0951-7474)
- A. Raigorodskii
Institutions
- Adyghe State University (RU)
- Moscow Institute of Physics and Technology (RU)
- Lomonosov Moscow State University (RU)
- Buryat State University (RU)
Publication Details
- Journal
- Discrete Applied Mathematics
- Published
- 2026-10-15
- DOI
- https://doi.org/10.1016/j.dam.2026.10.025
- Primary Topic
- Limits and Structures in Graph Theory
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Ministry of Science and Higher Education of the Russian Federation
- Foundation for the Advancement of Theoretical Physics and Mathematics