Graph Distinguishability and the Generation of Non-Isomorphic Labellings

• Main Author: Bird, William Herbert
• Other Authors: Myrvold, W. J.
• Language: English; en
• Published: 2013
• Subjects: Distinguishing Number; Sims Table; Schreier-Sims Algorithm; Computational Group Theory; Graph Algorithms; List-Distinguishing Colouring; Distinguishing Colouring; List-Distinguishing Number; Combinatorial Generation; Permutation Groups
• Online Access: http://hdl.handle.net/1828/4839

A distinguishing colouring of a graph G is a labelling of the vertices of G with colours such that no non-trivial automorphism of G preserves all colours. The distinguishing number of G is the minimum number of colours in a distinguishing colouring. This thesis presents a survey of the history of distinguishing colouring problems and proves new bounds and computational results about distinguishability. An algorithm to generate all labellings of a graph up to isomorphism is presented and compared to a previously published algorithm. The new algorithm is shown to have performance competitive with the existing algorithm, as well as being able to process automorphism groups far larger than the previous limit. A specialization of the algorithm is used to generate all minimal distinguishing colourings of a set of graphs with large automorphism groups and compute their distinguishing numbers. === Graduate === 0984 === 0405 === [e-mail]