Construction of strongly regular graphs using affine designs
From MaRDI portal
Publication:5603214
DOI10.1017/S0004972700046244zbMath0203.30802OpenAlexW2068841914MaRDI QIDQ5603214
Publication date: 1971
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0004972700046244
Related Items (26)
Constructing flag-transitive, point-imprimitive designs ⋮ Quasi-affine symmetric designs ⋮ Association schemes on 28 points as mergings of a half-homogeneous coherent configuration ⋮ 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 ⋮ A strongly regular decomposition of the complete graph and its association scheme ⋮ The smallest strictly Neumaier graph and its generalisations ⋮ A new construction of strongly regular graphs with parameters of the complement symplectic graph ⋮ Non-geometric cospectral mates of line graphs with a linear representation ⋮ On subdesigns of symmetric designs ⋮ Maximal arcs and related designs ⋮ On a family of highly regular graphs by Brouwer, Ivanov, and Klin ⋮ A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes ⋮ A construction of group divisible designs ⋮ Random strongly regular graphs? ⋮ Strongly regular graphs ⋮ Random strongly regular graphs? ⋮ Affine resolvable balanced incomplete block designs: a survey ⋮ Graph theory ⋮ On a class of symmetric designs ⋮ Commutative association schemes obtained from twin prime powers, Fermat primes, Mersenne primes ⋮ Flag-transitive symmetric 2-(96,20,4)-designs ⋮ On highly regular strongly regular graphs ⋮ Linked systems of symmetric group divisible designs of type. II ⋮ Construction of strongly regular graphs using affine designs
Cites Work
This page was built for publication: Construction of strongly regular graphs using affine designs