Distance (signless) Laplacian eigenvalues of k-uniform hypergraphs
From MaRDI portal
Publication:2102523
Recommendations
Cites work
- \(q\)-analogs of distance matrices of 3-hypertrees
- A q-analogue of the addressing problem of graphs by Graham and Pollak
- A survey on distance spectra of graphs
- Distance (signless) Laplacian spectral radius of uniform hypergraphs
- Distance eigenvalues and forwarding indices of circulants
- Distance eigenvalues of a cograph and their multiplicities
- Distance signless Laplacian eigenvalues of graphs
- Distance spectra of graphs: a survey
- Distance spectral radii of k-uniform hypertrees with given parameters
- Extremal properties of the distance spectral radius of hypergraphs
- On distance spectral radius of hypergraphs
- On distance spectral radius of uniform hypergraphs with cycles
- On graphs whose third largest distance eigenvalue dose not exceed \(-1\)
- On least distance eigenvalue of uniform hypergraphs
- Proof for four conjectures about the distance Laplacian and distance signless Laplacian eigenvalues of a graph
- Proof of conjectures on the distance signless Laplacian eigenvalues of graphs
- Some properties of the distance Laplacian eigenvalues of a graph.
- Spectra of graphs
- Two Laplacians for the distance matrix of a graph
Cited in
(5)- On least distance eigenvalue of uniform hypergraphs
- Distance (signless) Laplacian spectral radius of uniform hypergraphs
- On the distance energy of \(k\)-uniform hypergraphs
- Distance (signless) Laplacian spectra and energies of two classes of cyclic polyomino chains
- The proof of a conjecture on largest Laplacian and signless Laplacian H-eigenvalues of uniform hypergraphs
This page was built for publication: Distance (signless) Laplacian eigenvalues of \(k\)-uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102523)