In this paper, we give constructions of self-orthogonal codes from orbit matrices of Deza graphs, normally regular digraphs and Deza digraphs in terms of a definition given by Wang …
Deza grafove definirali su u [2] Erickson, Fernando, Haemers, Hardy i Hemmeter 1999. godine, kao poopcenje jako regularnih grafova. Zhang i Wang [3] su 2003. definirali Deza …
Erickson, Fernando, Haemers, Hardy and Hemmeter introduced Deza graphs in 1999 as a generalization of strongly regular graphs (see [2]). Deza digraphs were introduced in 2003 …