Distance spectral radii of k-uniform hypertrees with fixed diameter
From MaRDI portal
Publication:6570593
DOI10.1007/S10801-024-01316-ZzbMATH Open1543.05115MaRDI QIDQ6570593FDOQ6570593
Authors: Xiangxiang Liu, Ligong Wang 
Publication date: 10 July 2024
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Hypergraphs (05C65)
Cites Work
- Distance spectra of graphs: a survey
- On the Addressing Problem for Loop Switching
- On the distance matrix of a tree
- Distance matrix polynomials of trees
- Further results on the distance spectral radius of graphs
- Title not available (Why is that?)
- On the distance spectral radius of some graphs
- Distance matrix of a graph and its realizability
- On distance spectral radius of hypergraphs
- \(q\)-analogs of distance matrices of 3-hypertrees
- The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\)
- On distance spectral radius of uniform hypergraphs with cycles
- On least distance eigenvalue of uniform hypergraphs
- The first two largest spectral radii of uniform supertrees with given diameter
- Distance spectral radii of \(k\)-uniform hypertrees with given parameters
- Maximal distance spectral radius of 4-chromatic planar graphs
- Distance spectral radius of complete multipartite graphs and majorization
- On the second largest distance eigenvalue of a block graph
- Distance spectral radius of a tree with given diameter
Cited In (2)
This page was built for publication: Distance spectral radii of \(k\)-uniform hypertrees with fixed diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570593)
