Sharp Bounds On The Spectral Radii Of Uniform Hypergraphs Concerning Diameter Or Clique Number
DISCRETE DYNAMICS IN NATURE AND SOCIETY(2021)
摘要
In this paper, we defined two classes of hypergraphs, hyperbugs and kite hypergraphs. We show that balanced hyperbugs maximize the spectral radii of hypergraphs with fixed number of vertices and diameter and kite hypergraphs minimize the spectral radii of hypergraphs with fixed number of vertices and clique number.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要