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

DOI10.1080/03081087.2020.1770161MaRDI QIDQ5080245zbMATHOpenAlexFDO

Authors Lele Liu, Linyuan Lu

Publication date 31 May 2022

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1803.06385

zbMATH Keywords

uniform hypergraphweighted incidence matrix\(p\)-spectral radius\( \alpha \)-normal labelling

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hypergraphs (05C65) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: Let $G$ be an $r$-uniform hypergraph of order $n$. For each $pgeq1$, the $p$-spectral radius $lambd{a}^{(p)}(G)$ is defined as [ lambda^{(p)}(G):=max_{|x_1|^p+cdots+|x_n|^p=1} rsum_{{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 $lambd{a}^{(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 $lambd{a}^{(r)}(G)$. In this paper, we extend Lu and Man's $alpha$-normal labeling method to the $p$-spectral radii of uniform hypergraphs for $per$; and find some applications.

Recommendations

• Computing the \(p\)-spectral radii of uniform hypergraphs with applications
• On the \(\alpha \)-spectral radius of uniform hypergraphs
• \((\alpha,\beta)\)-labelling method for \(k\)-uniform hypergraph and its applications
• The \(\alpha\)-spectral radius of uniform hypergraphs concerning degrees and domination number
• On the \(\alpha\)-spectral radius of irregular uniform hypergraphs
• The \(\alpha \)-spectral radius of general hypergraphs
• The \(\alpha\)-normal labeling for generalized directed uniform hypergraphs
• On some properties of the \(\alpha \)-spectral radius of the \(k\)-uniform hypergraph
• On the \(\alpha \)-spectra of uniform hypergraphs and its associated graphs
• Lower bounds for the \(\mathcal{A}_\alpha\)-spectral radius of uniform hypergraphs

Cites work

• A bound on the spectral radius of hypergraphs with \(e\) edges
• A general product of tensors with applications
• Analytic methods for uniform hypergraphs
• Computing the \(p\)-spectral radii of uniform hypergraphs with applications
• Connected hypergraphs with small spectral radius
• Extremal problems for the \(p\)-spectral radius of graphs
• Hypergraph theory. An introduction
• Lagrangians of Hypergraphs
• On the principal eigenvectors of uniform hypergraphs
• Ordering uniform supertrees by their spectral radii
• Some extremal problems for hereditary properties of graphs
• Spectra of uniform hypergraphs
• Spectral extremal problems for hypergraphs
• Spectral radii of two kinds of uniform hypergraphs
• The extremal spectral radii of \(k\)-uniform supertrees
• The first few unicyclic and bicyclic hypergraphs with largest spectral radii
• The first two largest spectral radii of uniform supertrees with given diameter
• The spectra of uniform hypertrees

Cited in

(5)

• The \(\alpha\)-normal labeling for generalized directed uniform hypergraphs
• Extremal spectral radius of degree-based weighted adjacency matrices of graphs with given order and size
• \((\alpha,\beta)\)-labelling method for \(k\)-uniform hypergraph and its applications
• Some properties of the p-spectral radius on tensors for general hypergraphs and their applications
• Computing the \(p\)-spectral radii of uniform hypergraphs with applications

This page was built for publication: The α-normal labelling method for computing the p-spectral radii of uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080245)