On the $\alpha$-spectral radius of uniform hypergraphs
Combinatorics
2018-07-24 v1
Abstract
For and a uniform hypergraph , the -spectral radius of is the largest -eigenvalue of , where and are the diagonal tensor of degrees and the adjacency tensor of , respectively. We give upper bounds for the -spectral radius of a uniform hypergraph, propose some transformations that increase the -spectral radius, and determine the unique hypergraphs with maximum -spectral radius in some classes of uniform hypergraphs.
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}
}