×

zbMATH — the first resource for mathematics

Certain distance-regular digraphs and related rings of characteristic 4. (English) Zbl 0641.05022
Authors’ summary: “An infinite family of distance-regular edge transitive digraphs of girth 4 is constructed using cyclotomic extensions of the integers modulo 4. Automorphism groups are computed and it is shown that nonisomorphic digraphs with the same parameters occur in some cases.”
Reviewer: G.Chaty

MSC:
05C20 Directed graphs (digraphs), tournaments
05C25 Graphs and abstract algebra (groups, rings, fields, etc.)
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Bannai, E.E; Cameron, P.J; Kahn, J, Nonexistence of certain distance-transitive digraphs, J. combin. theory ser. B, 31, 105-110, (1981) · Zbl 0468.05035
[2] Bannai, E.E; Ito, T, Algebraic combinatorics I, association schemes, (1984), Benjamin/Cummings Menlo Park, CA · Zbl 0555.05019
[3] Bridges, W.G; Mena, R.A, On the rational spectra of graphs with abelian Singer groups, Linear algebra appl., 46, 51-60, (1982) · Zbl 0515.05036
[4] Cameron, P.J, Finite permutation groups and finite simple groups, Bull. London math. soc., 13, 1-22, (1981) · Zbl 0463.20003
[5] Damerell, R.M, Distance-transitive and distance-regular digraphs, J. combin. theory ser. B, 31, 46-53, (1981) · Zbl 0468.05034
[6] {\scH. Enomoto and R. A. Mena}, Distance-regular digraphs of girth 4, preprint. · Zbl 0642.05024
[7] Kantor, W.M, Linear groups containing a Singer cycle, J. algebra, 62, 232-235, (1980) · Zbl 0429.20004
[8] Lam, C.W.H, Distance-transitive digraphs, Discrete math., 29, 265-274, (1980) · Zbl 0442.05031
[9] Liebler, R.A; Yellen, J.E, In search of nonsolvable groups of central type, Pacific J. math., 82, 485-492, (1979) · Zbl 0387.20006
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.