Uniform supertrees with extremal spectral radii
有 extremal 的一致 supertrees 光谱半径作者机构:Department of MathematicsShanghai UniversityShanghai 200444China
出 版 物:《Frontiers of Mathematics in China》 (中国高等学校学术文摘·数学(英文))
年 卷 期:2020年第15卷第6期
页 面:1211-1229页
核心收录:
学科分类:07[理学] 0701[理学-数学] 070101[理学-基础数学]
基 金:supported by the National Natural Science Foundation of China(Grant Nos.11871040 11001166)
主 题:Hypergraph spectral radius supertree matching polynomial
摘 要:A supertree is a connected and acyclic *** investigate the supertrees with the extremal spectral radii among several kinds of r-uniform ***,by using the matching polynomials of supertrees,a new and useful grafting operation is proposed for comparing the spectral radii of supertrees,and its applications are shown to obtain the supertrees with the extremal spectral radi among some kinds of r-uniform ***,the supertree with the third smallest spectral radius among the r-uniform supertrees is ***,among the r-uniform supertrees with a given maximum degree,the supertree with the smallest spectral radius is *** last,among the r-uniform starlike supert rees,the supertrees with the smallest and the largest spectral radii are characterized.