An algorithm for determining the automorphism partitioning of an undirected graph
- 1 June 1972
- journal article
- research article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 12 (2) , 161-171
- https://doi.org/10.1007/bf01932810
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- On cliques in graphsIsrael Journal of Mathematics, 1965
- 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