The following pages link to (Q4228513):
Displaying 19 items.
- Asymptotic Delsarte cliques in distance-regular graphs (Q295820) (← links)
- The extendability of matchings in strongly regular graphs (Q405235) (← links)
- On triple systems and strongly regular graphs (Q439052) (← links)
- On the automorphism groups of strongly regular graphs. II. (Q468725) (← links)
- Computational complexity of reconstruction and isomorphism testing for designs and line graphs (Q618291) (← links)
- On the isomorphism of graphs having some eigenvalues of moderate multiplicity (Q896861) (← links)
- Permutation group approach to association schemes (Q1039422) (← links)
- The QAP-polytope and the graph isomorphism problem (Q1631655) (← links)
- Quantum algorithm design: techniques and applications (Q1730317) (← links)
- On explicit minimum weight bases for extended cyclic codes related to Gold functions (Q1791673) (← links)
- Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed (Q2153303) (← links)
- Coined quantum walks lift the cospectrality of graphs and trees (Q2270832) (← links)
- Distance-regular graphs without 4-claws (Q2311358) (← links)
- On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\) (Q2478163) (← links)
- Disconnecting strongly regular graphs (Q2637232) (← links)
- Spectrally Robust Graph Isomorphism (Q5002763) (← links)
- The Space Complexity of k-Tree Isomorphism (Q5387816) (← links)
- Switching for Small Strongly Regular Graphs (Q5869433) (← links)
- Entanglement entropy in the ground state of supersymmetric fermion lattice models (Q6496442) (← links)
