Quasi-thin weakly distance-regular digraphs,I

Benjian Lv; Kaishun Wang; Yuefeng Yang

REVIEW

Quasi-thin weakly distance-regular digraphs,I

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 1606.03521 v2 pith:JDJBPWZ6 submitted 2016-06-11 math.CO

Yuefeng Yang , Benjian Lv , Kaishun Wang This is my paper

classification math.CO

keywords distance-regularquasi-thinweaklydigraphcommutativedigraphsintersectionmaximum

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

A weakly distance-regular digraph is quasi-thin if the maximum value of its intersection numbers is 2. In this paper, we show that the valency of any commutative quasi-thin weakly distance-regular digraph is at most 6.

Discussion (0). Sign in to comment.

Pith tools