engleski

On some constructions of divisible design Cayley graphs and digraphs

Haemers, Kharaghani and Meulenberg have defined divisible design graphs (DDGs for short) as a generalization of (v, k, λ)-graphs. Divisible design digraphs, a directed graph version of divisible design graphs, were introduced by Crnković and Kharaghani. Let G be a group and S a subset of G not containing the identity element of the group, which will be denoted by e. The vertices of the Cayley digraph Cay(G, S) are the elements of the group G, and its arcs are all the couples (g, gs) with g ∈ G and s ∈ S. In this talk we will present some constructions of divisible design Cayley graphs and digraphs.

divisible design graph ; Cayley graph ; Cayley digraph

nije evidentirano