The α-normal labeling method for computing the p-spectral radii of uniform hypergraphs

2018/03/16 by Lele Liu, Liu, Lele, Linyuan Lü +1
Computer Science · Engineering · Mathematics · #05C65 #15A18 #Advanced Data Compression Techniques #Combinatorics (math.CO) #FOS: Mathematics #Tensor decomposition and applications #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1803.06385

openalex publication_date 2018/03/16 · openalex created_date 2018/03/29 · openalex updated_date 2026/07/28

Abstract

Let G be an r-uniform hypergraph of order n. For each p≥ 1, the p-spectral radius λ^(p)(G) is defined as λ^(p)(G):=max_{|x1|^p+⋯+|xn|^p=1} r∑_\i₁,…,i_r\∈ E(G)x_i1⋯ x_ir. The p-spectral radius was introduced by Keevash-Lenz-Mubayi, and subsequently studied by Nikiforov in 2014. The most extensively studied case is when p=r, and λ^(r)(G) is called the spectral radius of G. The α-normal labeling method, which was introduced by Lu and Man in 2014, is effective method for computing the spectral radii of uniform hypergraphs. It labels each corner of an edge by a positive number so that the sum of the corner labels at any vertex is 1 while the product of all corner labels at any edge is α. Since then, this method has been used by many researchers in studying λ^(r)(G). In this paper, we extend Lu and Man's α-normal labeling method to the p-spectral radii of uniform hypergraphs for p≠ r; and find some applications.

Related

• The (p,q)-spectral radii of (r,s)-directed hypergraphs
• Computing the p-Spectral Radii of Uniform Hypergraphs with Applications
• Lower bounds for the A_α-spectral radius of uniform hypergraphs
• On the α-spectral radius of uniform hypergraphs
• Sharp bounds for ordinary and signless Laplacian spectral radii of uniform hypergraphs