Locally semicomplete weakly distance-regular digraphs
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:SWMJGGMErecord.jsonopen to challenge →
classification
math.CO
keywords
semicompletelocallydigraphdigraphsdistance-regularweaklyassumptioncharacterize
read the original abstract
A digraph is semicomplete if any two vertices are connected by at least one arc and is locally semicomplete if the out-neighbourhood (resp. in-neighbourhood) of any vertex induces a semicomplete digraph. In this paper, we characterize all locally semicomplete weakly distance-regular digraphs under the assumption of commutativity.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.