A computer-assisted proof of the uniqueness of the Perkel graph

DOI10.1007/S10623-004-4852-9MaRDI QIDQ1766104zbMATH OpenOpenAlexFDO

Authors Kris Coolsaet, J. Degraer

Publication date 28 February 2005

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-004-4852-9

zbMATH Keywords

distance-regular graphintersection arraycomputer proof

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Recommendations

• Using symbolic computation to prove nonexistence of distance-regular graphs
• Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes
• Classification of some strongly regular subgraphs of the McLaughlin graph
• A spectral proof of the uniqueness of a strongly regular graph with parameters (81,20,1,6)
• The uniqueness of the strongly regular graph \(\mathrm{srg}(105,32,4,12)\)

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• An orderly algorithm and some applications in finite geometry
• Fast generation of cubic graphs
• Isomorph-Free Exhaustive Generation

Cited in

(8)

• An alternative way to generalize the pentagon
• INVESTIGATION OF CONTINUOUS-TIME QUANTUM WALKS VIA SPECTRAL ANALYSIS AND LAPLACE TRANSFORM
• On 3-chromatic distance-regular graphs
• Which graphs are determined by their spectrum?
• Characterizing distance-regularity of graphs by the spectrum
• Classification of some strongly regular subgraphs of the McLaughlin graph
• Classification of three-class association schemes using backtracking with dynamic variable ordering
• Association schemes with given stratum dimensions: on a paper of Peter M. Neumann

This page was built for publication: A computer-assisted proof of the uniqueness of the Perkel graph

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