1 |
M. O. Albertson and K. L. Collins, Symmetry breaking in graphs, Electron. J. Combin. 3 (1996), no. 1, Research paper 18, 17 pp.
|
2 |
B. Bogstad and L. J. Cowen, The distinguishing number of the hypercube, Discrete Math. 283 (2004), no. 1-3, 29-35.
DOI
ScienceOn
|
3 |
M. Chan, The distinguishing number of the direct product and wreath product action, J. Algebraic Combin. 24 (2006), no. 3, 331-345.
DOI
|
4 |
J. Dixon and B. Mortimer, Permutation Groups, Springer, GTM 163, 1996.
|
5 |
M. J. Fisher and G. Isaak, Distinguishing colorings of Cartesian products of complete graphs, Discrete Math. 308 (2008), no. 11, 2240-2246.
DOI
ScienceOn
|
6 |
W. Imrich and S. Klavzar, Distinguishing Cartesian powers of graphs, J. Graph Theory 53 (2006), no. 3, 250-260.
DOI
ScienceOn
|
7 |
G. A. Jones, Automorphisms and regular embeddings of merged Johnson graphs, Euro-pean J. Combin. 26 (2005), no. 3-4, 417-435.
DOI
ScienceOn
|
8 |
S. Klavzar and X. Zhu, Cartesian powers of graphs can be distinguished by two labels, European J. Combin. 28 (2007), no. 1, 303-310.
DOI
ScienceOn
|
9 |
T. L. Wong and X. Zhu, Distinguishing labeling of group actions, Discrete Math. 309 (2009), no. 6, 1760-1765.
DOI
ScienceOn
|
10 |
T. Van Zandt, PSTricks: PostScript macros for generic TEX, Available at ftp://ftp.princeton.edu/pub/tvz/.
|
11 |
M. O. Albertson and D. L. Boutin, Distinguishing geometric graphs, J. Graph Theory 53 (2006), no. 2, 135-150.
DOI
ScienceOn
|
12 |
M. O. Albertson and D. L. Boutin, Using determining sets to distinguish Kneser graphs, Electron. J. Combin. 14 (2007), no. 1, Research paper 20, 9 pp.
|