Pith. sign in

REVIEW

On the transmission of uniform unicyclic 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 1808.09962 v2 pith:DNPFJ2Q5 submitted 2018-08-29 math.CO

On the transmission of uniform unicyclic hypergraphs

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

The transmission of a connected hypergraph is defined as the summation of distances between all unordered pairs of distinct vertices. We determine the unique uniform unicyclic hypergraphs of fixed size with minimum and maximum transmissions, respectively.

discussion (0)

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