Ordering uniform supertrees by their spectral radii

2015/02/17 by Xiying Yuan, Yuan, Xiying
Mathematics · Medicine · #Advanced Neuroimaging Techniques and Applications #Combinatorics (math.CO) #FOS: Mathematics #Tensor decomposition and applications

paper · pdf · doi:10.48550/arxiv.1502.06474

openalex publication_date 2015/02/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A connected and acyclic hypergraph is called a supertree. In this paper we mainly focus on the spectral radii of uniform supertrees. Li, Shao and Qi determined the first two k-uniform supertrees with large spectral radii among all the k-uniform supertrees on n vertices [H. Li, J. Shao, L. Qi, The extremal spectral radii of k-uniform supertrees, arXiv:1405.7257v1, May 2014]. By applying the operation of moving edges on hypergraphs and using the weighted incidence matrix method we extend the above order to the fourth k-uniform supertree.

Citations

• The extremal spectral radii of k-uniform supertrees
• Connected Hypergraphs with Small Spectral Radius

Related

• The extremal spectral radii of k-uniform supertrees
• The matching polynomials and spectral radii of uniform supertrees
• A complete solution of the k-uniform supertrees with the eight largest α-spectral radii
• On the α-spectral radius of the k-uniform supertrees
• Constructing the r-uniform supertrees with the same spectral radius and matching energyv