All eigenvalues of the blowup of a graph
Ge Lin, Changjiang Bu

TL;DR
This paper provides a complete characterization of the eigenvalues of the s-blowup of a graph using the concept of 2s-weighted graphs, advancing spectral graph theory.
Contribution
It introduces 2s-weighted graphs and derives all eigenvalues of the s-blowup of a graph, offering a new spectral analysis method.
Findings
All eigenvalues of the s-blowup are explicitly determined.
The method applies to any s ≥ 2.
Provides a new tool for spectral analysis of hypergraph constructions.
Abstract
The -blowup of a graph () is the -uniform hypergraph obtained by replacing each vertex with a set of size and preserving the adjacency relation. In this paper, we define -weighted graphs and use them to give all eigenvalues of the -blowup of a graph.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Graph Labeling and Dimension Problems · Tensor decomposition and applications
