An algorithm for determining the automorphism partitioning of an undirected graph

DOI10.1007/BF01932810zbMath0235.68016MaRDI QIDQ5645023

Derek Gordon Corneil

Publication date: 1972

Published in: BIT (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (1)

Search for a unique incidence matrix of a graph

Cites Work

• Strongly regular graphs, partial geometries and partially balanced designs
• An Efficient Algorithm for Graph Isomorphism
• GIT—a heuristic program for testing pairs of directed line graphs for isomorphism
• On cliques in graphs

This page was built for publication: An algorithm for determining the automorphism partitioning of an undirected graph