The Doro graph is a distance-transitive and distance-regular graph on 68 vertices
and with valency 12. It is the unique automorphic
graph having intersection array 
(Gordon and Levingston 1981). Its automorphism
group is 
,
where 
denotes the semidirect product
of 
by 
(Gordon and Levingston 1981).
It has spectrum 
(van Dam 1996) and is therefore an integral graph.
The Doro graph is implemented in the Wolfram Language as GraphData["DoroGraph"].
Note that Koolen et al. (2023) use the term "Doro graph" to refer to the Hall graph (which was first considered by Doro),
which is a different distance-regular graph
that has intersection array 
.
."
." 15 Nov 2023.