On least distance eigenvalue of uniform hypergraphs
From MaRDI portal
Publication:1722033
DOI10.11650/tjm/180201zbMath1406.05062OpenAlexW2789084149MaRDI QIDQ1722033
Publication date: 14 February 2019
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.twjm/1519700415
uniform hypergraphdistance matrixdistance spreadleast distance eigenvalueuniform hypertreeuniform unicyclic hypergraph
Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (2)
On the distance \(\alpha \)-spectral radius of a connected graph ⋮ Distance (signless) Laplacian eigenvalues of \(k\)-uniform hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the distance spread of cacti and bicyclic graphs
- Distance spectral spread of a graph
- Distance spectral radius of uniform hypergraphs
- \(q\)-analogs of distance matrices of 3-hypertrees
- Signed graphs with least eigenvalue \(<-2\)
- On the distance matrix of a tree
- Distance matrix polynomials of trees
- Distance spectra of graphs: a survey
- On the least distance eigenvalue and its applications on the distance spread
- On the least distance eigenvalue of a graph
- On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphs
- On the distance spectrum of graphs
- The eigenvalue spreads of a hermitian matrix and its principal submatrices
- On the Addressing Problem for Loop Switching
This page was built for publication: On least distance eigenvalue of uniform hypergraphs
