Some properties of the spectral radius for general hypergraphs

详细信息    查看全文

• 作者：Wei Zhang ; ^{lindelfeel@gmail.com" class="auth_mail" title="E-mail the corresponding author} ; Lele Liu ; Liying Kang ; Yanqin Bai
• 关键词：15A42 ; 05C50
• 刊名：Linear Algebra and its Applications
• 出版年：2017
• 出版时间：15 January 2017
• 年：2017
• 卷：513
• 期：Complete
• 页码：103-119
• 全文大小：378 K

文摘

In this paper, the adjacency tensor of a general hypergraph is investigated. We study the Perron–Frobenius theorem for the general hypergraphs and obtain some relevant results based on it. In particular, the techniques of weighted incidence matrix and moving edge are extended to general hypergraphs for determining the structure with the maximum spectral radius. A nearly m  -uniform supertree is both connected and acyclic, in which each edge contains either mathmlsrc">mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0024379516304657&_mathId=si1.gif&_user=111111111&_pii=S0024379516304657&_rdoc=1&_issn=00243795&md5=306a4209a83a97aa8a9a0cbaef192594" title="Click to view the MathML source">m−1mathContainer hidden">mathCode"><math altimg="si1.gif" overflow="scroll">m−1math> or m vertices. To begin with, the structures obtaining the maximum spectral radius in two classes of nearly uniform supertrees are determined, where one class is with given number of edges and the other is with given number of vertices.