Extremal problems for the p-spectral radius of Berge hypergraphs

被引:0
作者
Zhou, Yacong [1 ]
Kang, Liying [1 ]
Liu, Lele [2 ]
Shan, Erfang [3 ]
机构
[1] Shanghai Univ, Dept Math, Shanghai 200444, Peoples R China
[2] Univ Shanghai Sci & Technol, Coll Sci, Shanghai 200093, Peoples R China
[3] Shanghai Univ, Sch Management, Shanghai 200444, Peoples R China
关键词
p-spectral radius; Berge-hypergraph; Uniform hypergraph;
D O I
10.1016/j.laa.2020.04.004
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Let G be a simple graph. We say that a hypergraph H is a Berge-G if there is a bijection phi: E(G) -> E(H) such that e subset of phi(e) for all e is an element of E(G). For any r-uniform hypergraph H and a real number p >= 1, the p-spectral radius lambda((p)) (H) of H is defined as lambda((p)) (H): = max( parallel to x parallel to p = 1)r Sigma({i1, i2, ..., ir} is an element of E(H) )x(i1) x(i2) ... x(ir). In this paper we study the p-spectral radius of Berge-G (G is an element of C-n(+)) hypergraphs and determine the 3-uniform hypergraphs with maximum p-spectral radius for p >= 1 among all Berge-G (G is an element of C-n(+)) hypergraphs, where C-n(+) is the set of graphs of order n obtained from C-n by adding an edge. (C) 2020 Elsevier Inc. All rights reserved.
引用
收藏
页码:22 / 39
页数:18
相关论文
共 31 条