scientific article; zbMATH DE number 3985261

MaRDI QIDQ3749082zbMATH OpenFDO

Authors Vladimir A. Skorobogatov, P. V. Khvorostov

Publication date 1984

zbMATH Keywords

algorithmstrongly regular graphsorbitautomorphisms of a graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Algorithms in computer science (68W99)

Recommendations

• Algorithmic aspects of algebraic methods for graph isomorphism testing
• scientific article; zbMATH DE number 2149407
• A heuristic algorithm of recognition of isomorphism of graphs
• Graph algebras and the graph isomorphism problem
• scientific article; zbMATH DE number 1256777

Cited in

(5)

• G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs
• Special issue of ADAM devoted to the International Workshop on Symmetries of Graph and Networks 2018
• Detecting almost symmetries of graphs
• Methods of destroying the symmetries of a graph
• scientific article; zbMATH DE number 1390064 (Why is no real title available?)

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 Q3749082)