给定独立数谱半径最大的一致超树  

Largest spectral radius of uniform hypertrees with a given independent number

作　　者：朱忠熏[1] 张萌 赵亚萍 郑李怡 谭连生 ZHU Zhongxun;ZHANG Meng;ZHAO Yaping;ZHENG Liyi;TAN Liansheng(College of Mathematics and Statistics,South-Central Minzu University,Wuhan 430074,China;College of Computer,Central China Normal University,Wuhan 430079,China)

机构地区：[1]中南民族大学数学与统计学学院,武汉430074 [2]华中师范大学计算机学院,武汉430079

出　　处：《中南民族大学学报（自然科学版）》2023年第3期415-419,共5页Journal of South-Central University for Nationalities：Natural Science Edition

基　　金：国家自然科学基金资助项目(62173157)。

摘　　要：一致超图H的谱半径就是其邻接张量A(H)特征值模的最大值.借助匹配多项式得到了使超树邻接谱半径增加的系列变换.作为这些变换的应用,确定了给定独立数且谱半径最大的k-一致超树.The spectral radius of a uniform hypergraphs H is the maximum modulus of the eigenvalues of its adjacent tensorA(H).Several transformations which increase spectral radius by matching polynomial are obtained.As their application,the k-uniform hypertrees with largest spectral radius are determined among all k-uniform hypertrees with given independent number.

关 键 词：超树 匹配多项式 谱半径 邻接张量 

分 类 号：O622[理学—有机化学]