Bart De Bruyn

activity

20102026

most citedOn generalized hexagons of order

(3, t)

and

(4, t)

containing a subhexagon

2 citations · 2 across the 5 of their papers we have counts for

collaborators

Showing 2026Show all

2 papers · 1 filter

math.CO2026

Divisible design graphs obtained by plugging a difference set into a construction for antipodal distance-regular graphs of diameter 3

Bart De Bruyn, Sergey Goryainov, Ruilin Ma +1

In this paper, we present a new construction of divisible design graphs with new parameters, obtained by plugging a difference set of a quotient group into a known construction of…

math.CO2026

A family of Neumaier graphs containing examples with exactly five eigenvalues

Bart De Bruyn, Rhys J. Evans, Sergey Goryainov +1

A Neumaier graph is an edge-regular graph with a regular clique. Such a graph is said to have parameters $(v, k, λ; e, s)$ if it is a $k$ -regular graph on $v$ vertices having a clique…