Publication:4228513
From MaRDI portal
zbMath0915.05104MaRDI QIDQ4228513
Publication date: 1 March 1999
05E30: Association schemes, strongly regular graphs
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Related Items
The Space Complexity of k-Tree Isomorphism, Asymptotic Delsarte cliques in distance-regular graphs, The extendability of matchings in strongly regular graphs, On triple systems and strongly regular graphs, On the automorphism groups of strongly regular graphs. II., Computational complexity of reconstruction and isomorphism testing for designs and line graphs, On the isomorphism of graphs having some eigenvalues of moderate multiplicity, Permutation group approach to association schemes, The QAP-polytope and the graph isomorphism problem, Quantum algorithm design: techniques and applications, On explicit minimum weight bases for extended cyclic codes related to Gold functions, Coined quantum walks lift the cospectrality of graphs and trees, Distance-regular graphs without 4-claws, On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\), Disconnecting strongly regular graphs
