Wu Zhi-Yong, He Jun, Liu Yan-Min, Tian Jun-Kang
School of Mathematics, Zunyi Normal College, Zunyi, P.R. China.
J Inequal Appl. 2018;2018(1):76. doi: 10.1186/s13660-018-1672-4. Epub 2018 Apr 6.
Let [Formula: see text] be a -uniform hypergraph on vertices with degree sequence [Formula: see text]. In this paper, in terms of degree [Formula: see text], we give a new upper bound for the -spectral radius of the adjacency tensor of [Formula: see text]. Some examples are given to show the efficiency of the bound.
设(\mathcal{H})是一个具有(n)个顶点且度序列为((d_1,d_2,\cdots,d_n))的(k -)均匀超图。在本文中，依据度(d_i)，我们给出了(\mathcal{H})的邻接张量的(k -)谱半径的一个新的上界。给出了一些例子以说明该界的有效性。
