一致超树的谱半径排序
Ordering uniform supertrees by their spectral radii
摘要：
一个连通的无圈超图称为超树。本文主要研究一致超树的谱半径。Li，Shao和Qi在$n$顶点上的所有$k$-一致超树中确定了前两个具有大谱半径的$k$-一致超树[H. Li，J. Shao，L. Qi，$k$ -均匀超树的极值谱半径，arXiv：1405.7257v1，2014年5月]。通过对超图的移动边操作和加权关联矩阵方法，我们将上述阶推广到第四类$k$ -一致超树。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
