A computer-assisted proof of the uniqueness of the Perkel graph
From MaRDI portal
Publication:1766104
DOI10.1007/s10623-004-4852-9zbMath1056.05149OpenAlexW2026317039MaRDI QIDQ1766104
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
Association schemes, strongly regular graphs (05E30) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items
On 3-chromatic distance-regular graphs, Characterizing distance-regularity of graphs by the spectrum, INVESTIGATION OF CONTINUOUS-TIME QUANTUM WALKS VIA SPECTRAL ANALYSIS AND LAPLACE TRANSFORM, Association schemes with given stratum dimensions: on a paper of Peter M. Neumann, Which graphs are determined by their spectrum?, Classification of some strongly regular subgraphs of the McLaughlin graph, An Alternative Way to Generalize the Pentagon, Classification of three-class association schemes using backtracking with dynamic variable ordering
Cites Work
