scientific article

zbMath1012.05158MaRDI QIDQ3150731

Dmitry G. Fon-Der-Flaass

Publication date: 17 October 2002

Full work available at URL: https://eudml.org/doc/122638

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (20)

Implementing Brouwer's database of strongly regular graphs ⋮ Constructing flag-transitive, point-imprimitive designs ⋮ Association schemes on 28 points as mergings of a half-homogeneous coherent configuration ⋮ Spectra of Deza graphs ⋮ Jordan schemes ⋮ New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs ⋮ A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs ⋮ Strongly regular graphs from classical generalized quadrangles ⋮ The smallest strictly Neumaier graph and its generalisations ⋮ A new construction of strongly regular graphs with parameters of the complement symplectic graph ⋮ On the order of antipodal covers ⋮ Non-geometric cospectral mates of line graphs with a linear representation ⋮ On a family of highly regular graphs by Brouwer, Ivanov, and Klin ⋮ Random strongly regular graphs? ⋮ Random strongly regular graphs? ⋮ Developments on spectral characterizations of graphs ⋮ Strongly regular tri-Cayley graphs ⋮ Flag-transitive symmetric 2-(96,20,4)-designs ⋮ On highly regular strongly regular graphs ⋮ Classification of three-class association schemes using backtracking with dynamic variable ordering

This page was built for publication: