Enumeration of strictly Deza graphs with at most 21 vertices

A Deza graph Γ with parameters (v, k, b, a) is a k -regulargraph with v vertices such that any two distinct vertices have b or a common neighbours, where b > a . A Deza graph of diameter 2 whichis not a strongly regular graph is called a strictly Deza graph. We find all 139 strictly Deza graphs up to 21 vertices and list corresponding constructions and properties.