21 citations · 22 across the 13 of their papers we have counts for
17 papers
New directed strongly regular graphs on 60 vertices
Dean Crnkovic, Andrea Svob, Matea Zubovic Zutolija
We prove the existence of directed strongly regular graphs with parameters (60,21,11,6,8), (60,22,12,8,8), (60,24,10,9,10), (60,25,17,8,12), (60,27,21,12,12) and (60,28,20,14,12).…
Transitive regular -analogs of graphs
Dean Crnkovic, Vedrana Mikulic Crnkovic, Andrea Svob +1
In 1976, Delsarte introduced the notion of -analogs of designs, and -analogs of graphs were introduced recently by M. Braun et al. In this paper, we extend that study by givi…
-Analogs of divisible design graphs and Deza graphs
Dean Crnkovic, Maarten De Boeck, Francesco Pavese +1
Divisible design graphs were introduced in 2011 by Haemers, Kharaghani and Meulenberg. In this paper, we introduce the notion of -analogs of divisible design graphs and show tha…
A construction of directed strongly regular graphs with parameters (63,11,8,1,2)
Andries E. Brouwer, Dean Crnković, Andrea Švob
In this paper, we prove the existence of directed strongly regular graphs with parameters . We construct a pair of nonisomorphic dsrg(63,11,8,1,2), where one is obta…
LCD subspace codes
Dean Crnkovic, Andrea Svob
A subspace code is a nonempty set of subspaces of a vector space . Linear codes with complementary duals, or LCD codes, are linear codes whose intersection with thei…
Distance-regular graphs obtained from the Mathieu groups
Dean Crnkovic, Nina Mostarac, Andrea Svob
In this paper we construct distance-regular graphs admitting a transitive action of the five sporadic simple groups discovered by E. Mathieu, the Mathieu groups , ,…
Strongly regular graphs with parameters (81,30,9,12) and a new partial geometry pg(5,5,2)
Dean Crnković, Andrea Švob, Vladimir D. Tonchev
Twelve new strongly regular graphs with parameters (81,30,9,12) are found as graphs invariant under certain subgroups of the automorphism groups of the two previously known graphs…
LDPC codes constructed from cubic symmetric graphs
Dean Crnkovic, Sanja Rukavina, Marina Simac
Low-density parity-check (LDPC) codes have been the subject of much interest due to the fact that they can perform near the Shannon limit. In this paper we present a construction o…
New constructions of Deza digraphs
Dean Crnkovic, Hadi Kharaghani, Sho Suda +1
Deza digraphs were introduced in 2003 by Zhang and Wang as directed graph version of Deza graphs, that also generalize the notion of directed strongly regular graphs. In this paper…
Divisible design Cayley digraphs
Dean Crnkovic, Hadi Kharaghani, Andrea Svob
Divisible design digraphs which can be obtained as Cayley digraphs are studied. A characterization of divisible design Cayley digraphs in terms of the generating sets is given. Fur…
Self-orthogonal codes from equitable partitions of association schemes
Dean Crnkovic, Sanja Rukavina, Andrea Svob
We give a method of constructing self-orthogonal codes from equitable partitions of association schemes. By applying this method we construct self-orthogonal codes from some distan…
LCD codes from weighing matrices
Dean Crnkovic, Ronan Egan, B. G. Rodrigues +1
Linear codes with complementary duals are linear codes whose intersection with their duals are trivial, shortly named LCD codes. In this paper we outline a construction for LCD cod…
On some distance-regular graphs with many vertices
Dean Crnkovic, Sanja Rukavina, Andrea Svob
We construct distance-regular graphs, including strongly regular graphs, admitting a transitive action of the Chevalley groups and , the orthogonal group …
Accelerator performance analysis of the Fermilab Muon Campus
Diktys Stratakis, Mary E. Convery, Carol Johnstone +7
Fermilab is dedicated to hosting world-class experiments in search of new physics that will operate in the coming years. The Muon g-2 Experiment is one such experiment that will de…
On transitive designs and strongly regular graphs constructed from Mathieu group
Dean Crnkovic, Andrea Svob
In this paper we construct structures from Mathieu group . We classify transitive -designs with 11, 12 and 22 points admitting a transitive action of Mathieu group $M_{1…
Strongly regular graphs from orthogonal groups and
Dean Crnković, Sanja Rukavina, Andrea Švob
In this paper we construct all strongly regular graphs, with at most 600 vertices, admitting a transitive action of the orthogonal group or . Consequently, we…
Classification of quasi-symmetric 2-(64,24,46) designs of Blokhuis-Haemers type
Dean Crnkovic, Bernardo Rodrigues, Sanja Rukavina +1
This paper completes the classification of quasi-symmetric 2- designs of Blokhuis-Haemers type supported by the dual code of the binary linear code span…