# zbMATH — the first resource for mathematics

Representations of directed strongly regular graphs. (English) Zbl 1121.05078
Summary: We develop a theory of representations in $$\mathbb R^m$$ for directed strongly regular graphs, which gives a new proof of a nonexistence condition of L. K. Jørgensen [Discrete Math. 264, 111–126 (2003; Zbl 1014.05074)]. We also describe some new constructions.

##### MSC:
 05C62 Graph representations (geometric and intersection representations, etc.) 05E30 Association schemes, strongly regular graphs
Full Text:
##### References:
 [1] A.E. Brouwer, S.A. Hobart, Parameters of directed strongly regular graphs. http://homepages.cwi.nl/ aeb/math/dsrg/dsrg.html · Zbl 1110.05320 [2] Duval, A.M., A directed graph version of strongly regular graphs, Jct(a), 47, 71-100, (1988) · Zbl 0642.05025 [3] Duval, A.M.; Iourinski, D., Semidirect product constructions of directed strongly regular graphs, Jct(a), 104, 157-167, (2003) · Zbl 1031.05135 [4] Fiedler, F.; Klin, M.; Pech, Ch., Directed strongly regular graphs as elements of coherent algebras, (), 69-87 [5] Godsil, C.D., Algebraic combinatorics, (1993), Chapman and Hall · Zbl 0814.05075 [6] Hobart, S.A.; Shaw, T.J., A note on a family of directed strongly regular graphs, European J. combin., 20, 819-820, (1999) · Zbl 0941.05036 [7] Jørgensen, L.K., Directed strongly regular graphs with $$\mu = \lambda$$, Discrete math., 231, 289-293, (2001) · Zbl 0979.05114 [8] Jørgensen, L.K., Non-existence of directed strongly regular graphs, Discrete math., 264, 111-126, (2003) · Zbl 1014.05074 [9] Klin, M.; Munemasa, A.; Muzychuk, M.; Zieschang, P.-H., Directed strongly regular graphs obtained from coherent algebras, Linear algebra appl., 377, 83-109, (2004) · Zbl 1030.05119
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.