REVIEW
Sharp bounds for ordinary and signless Laplacian spectral radii of uniform hypergraphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Sharp bounds for ordinary and signless Laplacian spectral radii of uniform hypergraphs
classification
math.CO
keywords
spectralboundsordinaryradiusdegreesgivelaplaciansharp
read the original abstract
We give sharp upper bounds for the ordinary spectral radius and signless Laplacian spectral radius of a uniform hypergraph in terms of the average $2$-degrees or degrees of vertices, respectively, and we also give a lower bound for the ordinary spectral radius. We also compare these bounds with known ones.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.