scientific article; zbMATH DE number 1256777
From MaRDI portal
Publication:4228513
Recommendations
- On the automorphism groups of strongly regular graphs. I
- Quasipolynomial-time canonical form for steiner designs
- Multi-stage design for quasipolynomial-time isomorphism testing of Steiner 2-systems
- Algorithmic aspects of algebraic methods for graph isomorphism testing
- scientific article; zbMATH DE number 4002140
Cited in
(34)- 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
- Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed
- 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
- Asymptotic Delsarte cliques in distance-regular graphs
- On the automorphism groups of strongly regular graphs. I
- Investigation graph isomorphism problem via entanglement entropy in strongly regular graphs
- Algorithmic aspects of algebraic methods for graph isomorphism testing
- Efficient Method to Perform Isomorphism Testing of Labeled Graphs
- scientific article; zbMATH DE number 3985261 (Why is no real title available?)
- scientific article; zbMATH DE number 4002140 (Why is no real title available?)
- The extendability of matchings in strongly regular graphs
- scientific article; zbMATH DE number 4127261 (Why is no real title available?)
- On triple systems and strongly regular graphs
- On testing isomorphism of graphs of bounded eigenvalue multiplicity
- On the automorphism groups of strongly regular graphs. II.
- Star partitions and the graph isomorphism problem
- Spectrally robust graph isomorphism
- The Space Complexity of k-Tree Isomorphism
- Approximating the isoperimetric number of strongly regular graphs
- Multi-stage design for quasipolynomial-time isomorphism testing of Steiner 2-systems
- Switching for small strongly regular graphs
- On the complexity of identifying strongly regular graphs
- Computational complexity of reconstruction and isomorphism testing for designs and line graphs
- Entanglement entropy in the ground state of supersymmetric fermion lattice models
- Faster isomorphism for p-groups of class 2 and exponent p
- Clique complexes of strongly regular graphs, their eigenvalues, and cohomology groups
- Bounding the Weisfeiler-Leman dimension via a depth analysis of I/R-trees
- On the isomorphism of graphs having some eigenvalues of moderate multiplicity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228513)
