Weakly distance-regular digraphs whose underlying graphs are distance-regular, I

Kaishun Wang; Qing Zeng; Yuefeng Yang

REVIEW

Weakly distance-regular digraphs whose underlying graphs are distance-regular, 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 2305.00276 v3 pith:YJJMNLAR submitted 2023-04-29 math.CO

Yuefeng Yang , Qing Zeng , Kaishun Wang This is my paper · ORCID

classification math.CO

keywords distance-regulargraphsweaklydigraphsunderlyingwhoseauthorclassify

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original abstract

Weakly distance-regular digraphs are a natural directed version of distance-regular graphs. In [8], the third author and Suzuki proposed a question when an orientation of a distance-regular graph defines a weakly distance-regular digraph. In this paper, we initiate this project, and classify all commutative weakly distance-regular digraphs whose underlying graphs are Hamming graphs, folded n-cubes and Doob graphs, respectively.

Discussion (0). Continue with ORCID to comment.

Pith tools