Graph Distinguishability and the Generation of Non-Isomorphic Labellings
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 di...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | English en |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1828/4839 |