5 papers
Switching graphs and designs
Aida Abiad, Dean Crnković, Louka Peters +1
Switching methods can be seen as certain local transformations that do not alter their basic parameters of a combinatorial structure. Efforts have been devoted in the literature to…
The existence of some directed strongly regular graphs on 54 and 108 vertices
Dean Crnković, Andrea Švob, Matea Zubović Žutolija
In this paper, we prove the existence of directed strongly regular graphs with parameters (108,11,3,2,1), (108,14,10,0,2), (108,22,12,6,4), (108,23,9,8,4), (108,25,15,8,5), (108,34…
A universal theory of switching for combinatorial objects, and applications to complex Hadamard matrices
Dean Crnković, Ronan Egan, Andrea Švob
The concept of switching has arisen in several different areas within combinatorics. The act of switching usually transforms a combinatorial object into a non-isomorphic object of…
Construction of directed strongly regular graphs via their orbit matrices and genetic algorithm
Dean Crnković, Andrea Švob, Tin Zrinski
In this paper, we introduce orbit matrices of directed strongly regular graphs (DSRGs). Further, we propose a method of constructing directed strongly regular graphs with prescribe…
Constructions of self-orthogonal and LCD subspace codes
Dean Crnković, Keita Ishizuka, Hadi Kharaghani +2
Recently, the notions of self-orthogonal subspace codes and LCD subspace codes were introduced, and LCD subspace codes obtained from mutually unbiased weighing matrices were studie…