On least distance eigenvalue of uniform hypergraphs
From MaRDI portal
Recommendations
Cites work
- \(q\)-analogs of distance matrices of 3-hypertrees
- Distance matrix polynomials of trees
- Distance spectra of graphs: a survey
- Distance spectral spread of a graph
- scientific article; zbMATH DE number 3982880 (Why is no real title available?)
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 3606484 (Why is no real title available?)
- On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphs
- On the Addressing Problem for Loop Switching
- On the distance matrix of a tree
- On the distance spectrum of graphs
- On the distance spread of cacti and bicyclic graphs
- On the least distance eigenvalue and its applications on the distance spread
- On the least distance eigenvalue of a graph
- Signed graphs with least eigenvalue \(<-2\)
- The eigenvalue spreads of a hermitian matrix and its principal submatrices
Cited in
(4)
This page was built for publication: On least distance eigenvalue of uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1722033)