Distance (signless) Laplacian eigenvalues of \(k\)-uniform hypergraphs
From MaRDI portal
Publication:2102523
DOI10.11650/tjm/220604zbMath1502.05137OpenAlexW4285116619MaRDI QIDQ2102523
Publication date: 29 November 2022
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.11650/tjm/220604
Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Unnamed Item
- Unnamed Item
- Two Laplacians for the distance matrix of a graph
- Proof of conjectures on the distance signless Laplacian eigenvalues of graphs
- Spectra of graphs
- Distance spectral radius of uniform hypergraphs
- \(q\)-analogs of distance matrices of 3-hypertrees
- On distance spectral radius of uniform hypergraphs with cycles
- On least distance eigenvalue of uniform hypergraphs
- Distance eigenvalues and forwarding indices of circulants
- Distance eigenvalues of a cograph and their multiplicities
- On graphs whose third largest distance eigenvalue dose not exceed \(-1\)
- Distance spectra of graphs: a survey
- Proof for four conjectures about the distance Laplacian and distance signless Laplacian eigenvalues of a graph
- Distance signless Laplacian eigenvalues of graphs
- Distance (signless) Laplacian spectral radius of uniform hypergraphs
- A q-Analogue of the Addressing Problem of Graphs by Graham and Pollak
- On distance spectral radius of hypergraphs
- Distance spectral radii of k-uniform hypertrees with given parameters
- Some properties of the distance Laplacian eigenvalues of a graph
This page was built for publication: Distance (signless) Laplacian eigenvalues of \(k\)-uniform hypergraphs