All eigenvalues of the blowup of a graph
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910021118328832 |
|---|---|
| author | Lin, Ge Bu, Changjiang |
| author_facet | Lin, Ge Bu, Changjiang |
| contents | The $s$-blowup of a graph ($s\geq2$) is the $2s$-uniform hypergraph obtained by replacing each vertex with a set of size $s$ and preserving the adjacency relation. In this paper, we define $2s$-weighted graphs and use them to give all eigenvalues of the $s$-blowup of a graph. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_12654 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | All eigenvalues of the blowup of a graph Lin, Ge Bu, Changjiang Combinatorics The $s$-blowup of a graph ($s\geq2$) is the $2s$-uniform hypergraph obtained by replacing each vertex with a set of size $s$ and preserving the adjacency relation. In this paper, we define $2s$-weighted graphs and use them to give all eigenvalues of the $s$-blowup of a graph. |
| title | All eigenvalues of the blowup of a graph |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2602.12654 |