English

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

Combinatorics 2018-04-25 v1

Abstract

An (r,s)(r,s)-directed hypergraph is a directed hypergraph with rr vertices in tail and ss vertices in head of each arc. Let GG be an (r,s)(r,s)-directed hypergraph. For any real numbers pp, q1q\geq 1, we define the (p,q)(p,q)-spectral radius λp,q(G)\lambda_{p,q}(G) as λp,q(G):=maxxp=yq=1eE(G)(uT(e)xu)(vH(e)yv), \lambda_{p,q}(G):=\max_{||{\bf x}||_p=||{\bf y}||_q=1} \sum_{e\in E(G)}\Bigg(\prod_{u\in T(e)}x_u\Bigg)\Bigg(\prod_{v\in H(e)}y_v\Bigg), where x=(x1,,xm)T{\bf x}=(x_1, \ldots, x_m)^{{\rm T}}, y=(y1,,yn)T{\bf y}=(y_1,\ldots, y_n)^{{\rm T}} are real vectors; and T(e)T(e), H(e)H(e) are the tail and head of arc ee, respectively. We study some properties about λp,q(G)\lambda_{p,q}(G) including the bounds and the spectral relation between GG and its components. The α\alpha-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 α\alpha-normal labeling method for calculating the (p,q)(p,q)-spectral radii of (r,s)(r,s)-directed hypergraphs. Finally, some applications of α\alpha-normal labeling method are given.

Keywords

Cite

@article{arxiv.1804.08808,
  title  = {The $(p,q)$-spectral radii of $(r,s)$-directed hypergraphs},
  author = {Lele Liu and Linyuan Lu},
  journal= {arXiv preprint arXiv:1804.08808},
  year   = {2018}
}

Comments

39 pages