Graphs characterized by the second distance eigenvalue

REVIEW

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 1406.3679 v1 pith:UOD6LUTA submitted 2014-06-14 math.CO

Rundan Xing , Bo Zhou This is my paper

classification math.CO

keywords distanceeigenvaluegraphssecondcharacterizecharacterizedconnectedless

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

We characterize all connected graphs with second distance eigenvalue less than $-0.5858$.