2000 character limit reached
On the $α$-spectral radius of uniform hypergraphs
Published 21 Jul 2018 in math.CO | (1807.08112v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.