Two Results Concerning Distance-Regular Directed Graphs
D. Combe and D. E. Taylor
Research Report 99-13
Date: 10 June 1999
The study of distance-regular directed graphs can be reduced to that of
short distance-regular directed graphs.
We consider the eigenspaces of the intersection matrix of a short
distance-regular directed graph and show that nearly all the eigenvalues
are nonreal. Next we show that a nontrivial short distance-regular directed
graph is primitive.
distance-regular graph. distance-transitive graph. directed graph.
primitivity. adjacency algebra.
AMS Subject Classification (1991)
Secondary: 05C25, 05E30
The paper is available in the following forms:
- TeX dvi format:
- 1999-13.dvi.gz (16kB) or
- 1999-13.ps.gz (40kB) or
To minimize network load, please choose the smaller gzipped .gz form if
and only if your browser client supports it.
Sydney Mathematics and Statistics