Distance spectral radii of k-uniform hypertrees with fixed diameter
From MaRDI portal
(Redirected from Publication:6570593)
Distance spectral radii of \(k\)-uniform hypertrees with fixed diameter
Distance spectral radii of \(k\)-uniform hypertrees with fixed diameter
Recommendations
Cites work
- \(q\)-analogs of distance matrices of 3-hypertrees
- Distance matrix of a graph and its realizability
- Distance matrix polynomials of trees
- Distance spectra of graphs: a survey
- Distance spectral radii of k-uniform hypertrees with given parameters
- Distance spectral radius of a tree with given diameter
- Distance spectral radius of complete multipartite graphs and majorization
- Further results on the distance spectral radius of graphs
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- Maximal distance spectral radius of 4-chromatic planar graphs
- On distance spectral radius of hypergraphs
- On distance spectral radius of uniform hypergraphs with cycles
- On least distance eigenvalue of uniform hypergraphs
- On the Addressing Problem for Loop Switching
- On the distance matrix of a tree
- On the distance spectral radius of some graphs
- On the second largest distance eigenvalue of a block graph
- The first two largest spectral radii of uniform supertrees with given diameter
- The graphs with exactly two distance eigenvalues different from -1 and -3
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)
