Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2510.06722 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- 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.