Least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices

作     者：Yizheng FAN Zhu ZHU Yi WANG Yizheng FAN;Zhu ZHU;Yi WANG

作者机构：School of Mathematical SciencesAnhui UniversityHefei 230601China 

出 版 物：《Frontiers of Mathematics in China》 (中国高等学校学术文摘·数学（英文）)

年 卷 期：2020年第15卷第3期

页      面：451-465页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：This work was supported by the National Natural Science Foundation of China(Grant Nos.11871073 11771016) 

主　　题：Hypergraph adjacency tensor least H-eigenvalue eigenvector perturbation 

摘      要：Let G be a connected hypergraph with even uniformity,which contains cut *** G is the coalescence of two nontrivial connected sub-hypergraphs(called branches)at a cut *** A(G)be the adjacency tensor of *** least H-eigenvalue of A(G)refers to the least real eigenvalue of A(G)associated with a real *** this paper,we obtain a perturbation result on the least H-eigenvalue of A(G)when a branch of G attached at one vertex is relocated to another vertex,and characterize the unique hypergraph whose least H-eigenvalue attains the minimum among all hypergraphs in a certain class of hypergraphs which contain a fixed connected hypergraph.