Pith. sign in

REVIEW

Distance spectral radius 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

arxiv 1602.08214 v1 pith:2JFDLQZX submitted 2016-02-26 math.CO

Distance spectral radius of uniform hypergraphs

classification math.CO
keywords distanceradiusspectraluniformhypergraphsmaximumminimumsecond
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We study the effect of three types of graft transformations to increase or decrease the distance spectral radius of uniform hypergraphs, and we determined the unique $k$-uniform hypertrees with maximum, second maximum, minimum and second minimum distance spectral radius, respectively.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.