scientific article; zbMATH DE number 1256777
From MaRDI portal
Publication:4228513
zbMath0915.05104MaRDI QIDQ4228513
Publication date: 1 March 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Association schemes, strongly regular graphs (05E30) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Asymptotic Delsarte cliques in distance-regular graphs ⋮ The QAP-polytope and the graph isomorphism problem ⋮ Disconnecting strongly regular graphs ⋮ Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed ⋮ Switching for Small Strongly Regular Graphs ⋮ Computational complexity of reconstruction and isomorphism testing for designs and line graphs ⋮ The extendability of matchings in strongly regular graphs ⋮ On the isomorphism of graphs having some eigenvalues of moderate multiplicity ⋮ On triple systems and strongly regular graphs ⋮ Unnamed Item ⋮ On the automorphism groups of strongly regular graphs. II. ⋮ The Space Complexity of k-Tree Isomorphism ⋮ Quantum algorithm design: techniques and applications ⋮ Spectrally Robust Graph Isomorphism ⋮ On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\) ⋮ Coined quantum walks lift the cospectrality of graphs and trees ⋮ On explicit minimum weight bases for extended cyclic codes related to Gold functions ⋮ Distance-regular graphs without 4-claws ⋮ Permutation group approach to association schemes
This page was built for publication:
