A Generator Set for Representing All Automorphisms of a Graph
- 1 May 1978
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 34 (3) , 593-596
- https://doi.org/10.1137/0134046
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance MatricesJournal of the ACM, 1976
- Optimum Featurs and Graph IsomorphismIEEE Transactions on Systems, Man, and Cybernetics, 1974
- A Backtrack Procedure for Isomorphism of Directed GraphsJournal of the ACM, 1973
- An Efficient Algorithm for Graph IsomorphismJournal of the ACM, 1970
- A Graph-Theoretic Algorithm for Matching Chemical Structures.Journal of Chemical Documentation, 1965
- GIT—a heuristic program for testing pairs of directed line graphs for isomorphismCommunications of the ACM, 1964
- Strongly regular graphs, partial geometries and partially balanced designsPacific Journal of Mathematics, 1963