cicyt UNIZAR
Full-text links:

Download:

Current browse context:

math.CO

Change to browse by:

References & Citations

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo ScienceWISE logo

Mathematics > Combinatorics

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

Abstract: Let $G$ be an $r$-uniform hypergraph of order $n$. For each $p\geq 1$, the $p$-spectral radius $\lambda^{(p)}(G)$ is defined as \[ \lambda^{(p)}(G):=\max_{|x_1|^p+\cdots+|x_n|^p=1} r\sum_{\{i_1,\ldots,i_r\}\in E(G)}x_{i_1}\cdots x_{i_r}. \] 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 $\lambda^{(r)}(G)$ is called the spectral radius of $G$. The $\alpha$-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 $\alpha$. Since then, this method has been used by many researchers in studying $\lambda^{(r)}(G)$. In this paper, we extend Lu and Man's $\alpha$-normal labeling method to the $p$-spectral radii of uniform hypergraphs for $p\ne r$; and find some applications.
Comments: 24 pages
Subjects: Combinatorics (math.CO)
MSC classes: 05C65, 15A18
Cite as: arXiv:1803.06385 [math.CO]
  (or arXiv:1803.06385v1 [math.CO] for this version)

Submission history

From: Linyuan Lu [view email]
[v1] Fri, 16 Mar 2018 20:00:46 GMT (15kb)