English

On the $\alpha$-spectral radius of uniform hypergraphs

Combinatorics 2018-07-24 v1

Abstract

For 0α<10\le\alpha<1 and a uniform hypergraph GG, the α\alpha-spectral radius of GG is the largest HH-eigenvalue of αD(G)+(1α)A(G)\alpha \mathcal{D}(G) +(1-\alpha)\mathcal{A}(G), where D(G)\mathcal{D}(G) and A(G)\mathcal{A}(G) are the diagonal tensor of degrees and the adjacency tensor of GG, respectively. We give upper bounds for the α\alpha-spectral radius of a uniform hypergraph, propose some transformations that increase the α\alpha-spectral radius, and determine the unique hypergraphs with maximum α\alpha-spectral radius in some classes of uniform hypergraphs.

Keywords

Cite

@article{arxiv.1807.08112,
  title  = {On the $\alpha$-spectral radius of uniform hypergraphs},
  author = {HaiYan Guo and Bo Zhou},
  journal= {arXiv preprint arXiv:1807.08112},
  year   = {2018}
}
R2 v1 2026-06-23T03:09:21.696Z