Minimizing the distance spectral radius of uniform hypertrees with given parameters

DOI10.1007/S40314-023-02404-9OpenAlexW4385576324MaRDI QIDQ6095388

No author found.

Publication date: 8 September 2023

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-023-02404-9

zbMATH Keywords

diameteruniform hypergraphdistance spectral radiusuniform hypertreependant edges

Mathematics Subject Classification ID

Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectra of uniform hypergraphs
• Distance spectral radius of uniform hypergraphs
• \(q\)-analogs of distance matrices of 3-hypertrees
• On distance spectral radius of uniform hypergraphs with cycles
• On distance spectral radius of graphs
• Analytic methods for uniform hypergraphs
• Distance spectra of graphs: a survey
• Distance spectral radius of trees with fixed number of pendent vertices
• Further results on the distance spectral radius of graphs
• A q-Analogue of the Addressing Problem of Graphs by Graham and Pollak
• Distance spectral radius of a tree with given diameter
• Distance spectral radius of trees with fixed maximum degree
• On distance spectral radius of hypergraphs
• Distance spectral radii of k-uniform hypertrees with given parameters
• On distance spectral radius of trees with fixed maximum degree
• On the Addressing Problem for Loop Switching

This page was built for publication: Minimizing the distance spectral radius of uniform hypertrees with given parameters