Construction of strongly regular graphs using affine designs

From MaRDI portal
Publication:5603214

DOI10.1017/S0004972700046244zbMath0203.30802OpenAlexW2068841914MaRDI QIDQ5603214

Walter D. Wallis

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 designsQuasi-affine symmetric designsAssociation schemes on 28 points as mergings of a half-homogeneous coherent configurationJordan schemesNew versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphsA generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphsA strongly regular decomposition of the complete graph and its association schemeThe smallest strictly Neumaier graph and its generalisationsA new construction of strongly regular graphs with parameters of the complement symplectic graphNon-geometric cospectral mates of line graphs with a linear representationOn subdesigns of symmetric designsMaximal arcs and related designsOn a family of highly regular graphs by Brouwer, Ivanov, and KlinA survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemesA construction of group divisible designsRandom strongly regular graphs?Strongly regular graphsRandom strongly regular graphs?Affine resolvable balanced incomplete block designs: a surveyGraph theoryOn a class of symmetric designsCommutative association schemes obtained from twin prime powers, Fermat primes, Mersenne primesFlag-transitive symmetric 2-(96,20,4)-designsOn highly regular strongly regular graphsLinked systems of symmetric group divisible designs of type. IIConstruction of strongly regular graphs using affine designs



Cites Work




This page was built for publication: Construction of strongly regular graphs using affine designs