论文标题
具有给定尺寸的双环均匀超图的最小光谱半径
The smallest spectral radius of bicyclic uniform hypergraphs with a given size
论文作者
论文摘要
具有极端特性的识别图是光谱图理论中的广泛研究主题。在本文中，我们研究了与$α$ - 正常的加权入射率矩阵相关的迭代序列的对数洞穴，该序列由Lu和Man提出，用于计算HyperGraphs的光谱半径。通过使用有关序列和某些边缘操作的方法获得的结果，我们将表征具有给定尺寸的双环超图中最小光谱半径的完全极端K图。
Identifying graphs with extremal properties is an extensively studied topic in spectral graph theory. In this paper, we study the log-concavity of a type of iteration sequence related to the $α$-normal weighted incidence matrices which is presented by Lu and Man for computing the spectral radius of hypergraphs. By using results obtained about the sequence and the method of some edge operations, we will characterize completely extremal k-graphs with the smallest spectral radius among bicyclic hypergraphs with given size.
