The extremal -spectral radius of Berge-hypergraphs
arXiv:1812.06032
Abstract
Let be a graph. We say that a hypergraph is a Berge- if there is a bijection such that for all . For any -uniform hypergraph and a real number , the -spectral radius of is defined as \[ λ^{(p)}(H):=\max_{{\bf x}\in\mathbb{R}^n,\,\|{\bf x}\|_p=1} r\sum_{\{i_1,i_2,\ldots,i_r\}\in E(H)} x_{i_1}x_{i_2}\cdots x_{i_r}. \] In this paper, we study the -spectral radius of Berge- hypergraphs. We determine the -uniform hypergraphs with maximum -spectral radius for among Berge- hypergraphs when is a path, a cycle or a star.
arXiv comment15 pages
References in corpus (6)
- Avoiding long Berge cycles II, exact bounds for all
- Avoiding long Berge cycles
- Avoiding long Berge cycles, the missing cases and
- A note on Ramsey numbers for Berge-G hyper graphs
- The maximum -Spectral Radius of Hypergraphs with Edges
- The -normal labeling method for computing the -spectral radii of uniform hypergraphs