2000 character limit reached
Some bounds on the eigenvalues of uniform hypergraphs
Published 17 Feb 2015 in math.CO | (1502.06475v1)
Abstract: Let $\mathcal{H}$ be a uniform hypergraph. Let $\mathcal{A(H)}$ and $\mathcal{Q(H)}$ be the adjacency tensor and the signless Laplacian tensor of $\mathcal{H}$, respectively. In this note we prove several bounds for the spectral radius of $\mathcal{A(H)}$ and $\mathcal{Q(H)}$ in terms of the degrees of vertices of $\mathcal{H}.$
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.