Distance spectral radii of k-uniform hypertrees with given parameters

DOI10.1080/03081087.2019.1682497zbMath1472.05098OpenAlexW2982649005MaRDI QIDQ4959327

Xiangxiang Liu, Xihe Li, Li-Gong Wang

Publication date: 13 September 2021

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2019.1682497

zbMATH Keywords

independence numbermatching numberdistance spectral radius\(k\)-uniform hypertree

Mathematics Subject Classification ID

Trees (05C05) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Distance spectral radii of k-uniform bicyclic hypergraphs ⋮ Minimizing the distance spectral radius of uniform hypertrees with given parameters ⋮ Distance (signless) Laplacian eigenvalues of \(k\)-uniform hypergraphs

Cites Work

• Unnamed Item
• Distance spectral radius of trees with given matching number
• Distance spectral radius of uniform hypergraphs
• \(q\)-analogs of distance matrices of 3-hypertrees
• On the distance matrix of a tree
• Distance matrix polynomials of trees
• On distance spectral radius of uniform hypergraphs with cycles
• On the spectral radius of uniform hypertrees
• Distance spectra of graphs: a survey
• Distance spectral radius of trees with fixed number of pendent vertices
• On distance spectral radius of hypergraphs
• On the Addressing Problem for Loop Switching

This page was built for publication: Distance spectral radii of k-uniform hypertrees with given parameters