On the α-spectral radius of uniform hypergraphs
classification
🧮 math.CO
keywords
alpharadiusspectralmathcaluniformhypergraphshypergraphsome
read the original abstract
For $0\le\alpha<1$ and a uniform hypergraph $G$, the $\alpha$-spectral radius of $G$ is the largest $H$-eigenvalue of $\alpha \mathcal{D}(G) +(1-\alpha)\mathcal{A}(G)$, where $\mathcal{D}(G)$ and $\mathcal{A}(G)$ are the diagonal tensor of degrees and the adjacency tensor of $G$, 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.