engleski

Divisible design Cayley graphs and digraphs

Haemers, Kharaghani and Meulenberg have defined divisible design graphs 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 results on divisible design Cayley digraphs and give some constructions of such digraphs. Further, we will give some improvements on the study of divisible design Cayley graphs. Finally, we will introduce a variation of directed Deza graphs and give connections between combinatorial structures presented in this talk.

divisible design graph ; Cayley graph ; Cayley digraph

nije evidentirano