The signless Laplacian matrix of hypergraphs
From MaRDI portal
Publication:2148847
DOI10.1515/spma-2022-0166zbMath1489.05108arXiv1909.00246OpenAlexW2971375998MaRDI QIDQ2148847
Publication date: 24 June 2022
Published in: Special Matrices (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.00246
Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (3)
A spectral method to incidence balance of oriented hypergraphs and induced signed hypergraphs ⋮ Some bounds on spectral radius of signless Laplacian matrix of k-graphs ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Spectra of uniform hypergraphs
- An oriented hypergraphic approach to algebraic graph theory
- Spectra of general hypergraphs
- Signless Laplacians of finite graphs
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Laplacian eigenvalues and partition problems in hypergraphs
- Spectra of hypergraphs and applications
- Hypergraph theory. An introduction
- Principal eigenvector of the signless Laplacian matrix
- The spectrum of a class of uniform hypergraphs
- Spectra of cycle and path families of oriented hypergraphs
- Spectral radius of uniform hypergraphs
- Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues
- Energies of Hypergraphs
- Towards a spectral theory of graphs based on the signless Laplacian, I
- On the Laplacian Spectrum and Walk-regular Hypergraphs
- On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs
- On distance spectral radius of hypergraphs
- Towards a spectral theory of graphs based on the signless Laplacian, III
- Most Tensor Problems Are NP-Hard
- Spectral properties of oriented hypergraphs
- The Eigenvalues of a Graph and Its Chromatic Number
This page was built for publication: The signless Laplacian matrix of hypergraphs
