The (p,q)-spectral radii of (r,s)-directed hypergraphs

2018/04/24 by Liu, Lele, Lu, Linyuan
#05C50 #05C65 #15A18 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1804.08808

Abstract

An (r,s)-directed hypergraph is a directed hypergraph with r vertices in tail and s vertices in head of each arc. Let G be an (r,s)-directed hypergraph. For any real numbers p, q≥ 1, we define the (p,q)-spectral radius λ_p,q(G) as λ_p,q(G):=max_||\bf x||_p=||\bf y||_q=1 ∑_{e∈ E(G)}(∏_{u∈ T(e)}x_u)(∏_{v∈ H(e)}y_v), where \bf x=(x₁, …, x_m)^{\rm T}, \bf y=(y₁,…, y_n)^{\rm T} are real vectors; and T(e), H(e) are the tail and head of arc e, respectively. We study some properties about λ_p,q(G) including the bounds and the spectral relation between G and its components. The α-normal labeling method for uniform hypergraphs was introduced by Lu and Man in 2014. It is an effective method in studying the spectral radii of uniform hypergraphs. In this paper, we develop the α-normal labeling method for calculating the (p,q)-spectral radii of (r,s)-directed hypergraphs. Finally, some applications of α-normal labeling method are given.

Related

• The α-normal labeling method for computing the p-spectral radii of uniform hypergraphs
• Spectral extremal problems for the (p,Q)-spectral radius of hypergraphs
• On the α-spectral radius of hypergraphs
• Lower bounds for the A_α-spectral radius of uniform hypergraphs
• On the α-spectral radius of uniform hypergraphs