Line Multigraphs of Hypergraphs
Kau\^e Cardoso

TL;DR
This paper explores the structural and spectral properties of line multigraphs derived from hypergraphs, revealing how key characteristics are preserved and establishing bounds for eigenvalues, with applications to hypergraph spectral theory.
Contribution
It introduces new spectral bounds and structural insights for line multigraphs of hypergraphs, extending fundamental properties of line graphs to hypergraph contexts.
Findings
Eigenvalues of line multigraphs are ≥ -r for hypergraphs of rank r
Connectivity, linearity, and regularity are preserved in line multigraphs
Provides bounds for the signless Laplacian spectral radius of hypergraphs
Abstract
A line multigraph is obtained from a hypergraph as follows: the vertices of the multigraph correspond to the hyperedges of the hypergraph, and the number of edges between two vertices is given by the number of vertices shared by the corresponding hyperedges. In this paper, we establish several structural and spectral properties of this class of multigraphs. More precisely, we show that important structural characteristics, such as connectivity, linearity, and regularity are, in some sense, preserved between a hypergraph and its line multigraph. We also prove that the eigenvalues of the line multigraph associated with a general hypergraph of rank are greater than or equal to , which generalizes a fundamental spectral property of line graphs. Furthermore, we provide sufficient conditions for to be an eigenvalue of the line multigraph. Finally, we present applications of line…
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
TopicsTensor decomposition and applications · Graph theory and applications · Interconnection Networks and Systems
