activity
20162026
most citedCameron-Liebler sets of generators in finite classical polar spaces

16 citations · 36 across the 20 of their papers we have counts for

collaborators
Showing 2021Show all

6 papers · 1 filter

math.CO2021

Switching for 2-designs

Dean Crnković, Andrea Švob

In this paper we introduce a switching for 2-designs. We illustrate this method by applying it to some symmetric (64,28,12) designs. In that way we obtain six new symmetric (64,28,…

math.CO2021

New constructions of divisible design Cayley graphs

Dean Crnković, Andrea Švob

Divisible design graphs were introduced in 2011 by Haemers, Kharaghani and Meulenberg. Further, divisible design graphs which can be obtained as Cayley graphs were recently studied…

math.CO2021

New symmetric 2-(176,50,14) designs

Dean Crnković, Andrea Švob

In this paper we construct two new symmetric designs with parameters 2-(176,50,14) as designs invariant under certain subgroups of the full automorphism group of the Higman design.…

math.CO2021

Neighbour-Transitive Codes and Partial Spreads in Generalised Quadrangles

Dean Crnković, Daniel R. Hawtin, Andrea Ŝvob

A code in a generalised quadrangle is defined to be a subset of the vertex set of the point-line incidence graph of . The minimum dista…

math.CO2021

-Analogs of strongly regular graphs

Michael Braun, Dean Crnković, Maarten De Boeck +2

We introduce the notion of q-analogs of strongly regular graphs and give several examples of such structures. We prove a necessary condition on the parameters, show the connection…

math.CO2021

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 , ,…