Algorithmic Techniques for the Generation and Analysis of Strongly Regular Graphs and other Combinatorial Configurations

DOI10.1016/S0167-5060(08)70319-4zbMath0398.05054OpenAlexW177804185MaRDI QIDQ4182792

Rudolf A. Mathon, Derek Gordon Corneil

Publication date: 1978

Published in: Algorithmic Aspects of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70319-4

zbMATH Keywords

Analysis Generation Strongly Regular Graphs Algorithmic Techniques Combinatorial Configurations

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)

Related Items (8)

The QAP-polytope and the graph isomorphism problem ⋮ Automorphism free Latin square graphs ⋮ Constructing block designs with a prescribed automorphism group using genetic algorithm ⋮ On triple systems and strongly regular graphs ⋮ The Paulus–Rozenfeld–Thompson Graph on 26 Vertices Revisited and Related Combinatorial Structures ⋮ Exploiting symmetries within constraint satisfaction search ⋮ A graph isomorphism algorithm for object recognition ⋮ Memetic collaborative approaches for finding balanced incomplete block designs

This page was built for publication: Algorithmic Techniques for the Generation and Analysis of Strongly Regular Graphs and other Combinatorial Configurations