Some bounds on spectral radius of signless Laplacian matrix of k-graphs
From MaRDI portal
Publication:6140941
DOI10.1051/ro/2023109MaRDI QIDQ6140941
Publication date: 22 January 2024
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectra of uniform hypergraphs
- An oriented hypergraphic approach to algebraic graph theory
- Some upper bounds on the eigenvalues of uniform hypergraphs
- Spectra of graphs
- Spectral radius of uniform hypergraphs and degree sequences
- Extreme eigenvalues of nonregular graphs
- The spectral radius of subgraphs of regular graphs
- The spectral radius of irregular graphs
- Laplacian eigenvalues and partition problems in hypergraphs
- Principal eigenvectors and spectral radii of uniform hypergraphs
- The largest eigenvalue of nonregular graphs
- On the signless Laplacian spectral radius of irregular graphs
- The signless Laplacian matrix of hypergraphs
- On the spectrum of hypergraphs
- The spectral radius and the maximum degree of irregular graphs
- Eigenvalues of a real supersymmetric tensor
- On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs
- On theα-spectral radius of irregular uniform hypergraphs
- Most Tensor Problems Are NP-Hard
- Spectral properties of oriented hypergraphs
- The (signless Laplacian) spectral radius (of subgraphs) of uniform hypergraphs