engleski

Divisible design digraphs

Divisible design graphs have been recently defined by Haemers, Kharaghani and Meulenberg as a generalization of $(v, k, \lambda)$-graphs. In this paper we define and study divisible design digraphs, a directed graph version of divisible design graphs. On the other hand, divisible design digraphs are also natural generalization of doubly regular asymmetric digraphs. We obtain necessary conditions for the existence of a DDD with given parameters and give some constructions.

Directed graph ; Divisible design ; Divisible design graph

nije evidentirano