Construction of strongly regular graphs using affine designs

DOI10.1017/S0004972700046244MaRDI QIDQ5603214zbMATH OpenOpenAlexFDO

Authors 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

Cites work

• A note on quasi-symmetric designs
• On a combinatorial generalization of 27 lines associated with a cubic surface
• Strongly Regular Graphs Derived from Combinatorial Designs
• Strongly regular graphs, partial geometries and partially balanced designs

Cited in

(31)

• Strongly regular graphs decomposable into a divisible design graph and a Delsarte clique
• A large family of strongly regular graphs with small Weisfeiler-Leman dimension
• On a family of highly regular graphs by Brouwer, Ivanov, and Klin
• Jordan schemes
• Commutative association schemes obtained from twin prime powers, Fermat primes, Mersenne primes
• Linked systems of symmetric group divisible designs of type. II
• Random strongly regular graphs?
• On subdesigns of symmetric designs
• On a class of symmetric designs
• Constructing flag-transitive, point-imprimitive designs
• Non-geometric cospectral mates of line graphs with a linear representation
• Maximal arcs and related designs
• Flag-transitive symmetric 2-(96,20,4)-designs
• A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs
• Affine resolvable balanced incomplete block designs: a survey
• The smallest strictly Neumaier graph and its generalisations
• Random strongly regular graphs?
• Strongly regular graphs
• Graph theory
• A construction of group divisible designs
• Constructing flag-transitive, point-primitive 2-designs from complete graphs
• On highly regular strongly regular graphs
• A strongly regular decomposition of the complete graph and its association scheme
• New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs
• Construction of divisible design graphs using affine designs
• A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes
• A new construction of strongly regular graphs with parameters of the complement symplectic graph
• Quasi-affine symmetric designs
• Association schemes on 28 points as mergings of a half-homogeneous coherent configuration
• On 3-isoregularity of multicirculants
• Construction of strongly regular graphs using affine designs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5603214)