一致超树的匹配多项式和谱半径
The matching polynomials and spectral radii of uniform supertrees
摘要:
研究了一致超图的匹配多项式和一致超树的谱半径。通过比较超树的匹配多项式,我们将Li和Feng关于图的嫁接运算的结果推广到超树上。利用超树的嫁接操作和超树匹配多项式的比较方法,确定了具有大小$m$和直径$d$的$r$ -一致超树的前$\lfloor\frac{d}{2}\rfloor+1$最大谱半径.此外,确定了具有$m$大小的超树的前两个最小谱半径。
英文摘要:
We study matching polynomials of uniform hypergraph and spectral radii of uniform supertrees. By comparing the matching polynomials of supertrees, we extend Li and Feng's results on grafting operations on graphs to supertrees. Using the methods of grafting operations on supertrees and comparing matching polynomials of supertrees, we determine the first $\lfloor\frac{d}{2}\rfloor+1$ largest spectral radii of $r$-uniform supertrees with size $m$ and diameter $d$. In addition, the first two smallest spectral radii of supertrees with size $m$ are determined.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。