Isomorphism Testing and Symmetry of Graphs

DOI10.1016/S0167-5060(08)70857-4zbMath0442.05034OpenAlexW95977715MaRDI QIDQ3884133

László Babai

Publication date: 1980

Published in: Combinatorics 79 Part I (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70857-4

zbMATH Keywords

reducibilityautomorphism groupstrongly regular graphsrandom graphscubic graphsMonte-Carlo algorithmsgraphs with primitive automorphism groupscomplexity of graph isomorphism testinggraphs with bounded eigenvalue multiplicitiesgraphs with colored vertices with small color- classes

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (7)

On bipartite distance-regular Cayley graphs with small diameter ⋮ On the complexity of reconstructing H-free graphs from their Star Systems ⋮ Switching for Small Strongly Regular Graphs ⋮ A new measure of symmetry and its application to classification of bifurcating structures ⋮ Le problème d'étoiles pour graphes est NP-complèt ⋮ On the Complexity of Reconstructing H-free Graphs from Their Star Systems ⋮ Graph isomorphism problem

This page was built for publication: Isomorphism Testing and Symmetry of Graphs