The maximum distinguishing number of a group

Electronic Journal of Combinatorics

Volumn 13, Issue 1 R, 2006, Pages 1-8

  Chan, Melody ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33747074906     PISSN: 10778926     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/1096     Document Type: Article

References (12)

1. M. Albertson and K. Collins, An introduction to symmetry breaking in graphs, Graph Theory Notes N.Y. 30 (1996) 6-7.
2. M. Albertson and K. Collins, Symmetry breaking in graphs, Electronic Journal of Combinatorics 3 (1996) R18.
3. B. Bogstad and L. Cowen, The distinguishing number of the hypercube, Discrete Mathematics 283 (2004) 29-35.
4. H. G. Bray et al., Between Nilpotent and Solvable, Polygonal Publishing House, NJ, 1982.
5. M. Chan, The distinguishing number of the augmented cube and hypercube powers, preprint.
6. M. Chan, The distinguishing number of the direct product and wreath product action, Journal of Algebraic Combinatorics, to appear.
7. C.C.T. Cheng, Three problems in graph labeling, Ph.D. Thesis, Department of Mathematical Sciences, Johns Hopkins University, 1999.
8. M. Hall, The Theory of Groups, Macmillan, New York, 1959.
9. C. E. Hempel, Metacyclic groups, Communications in Algebra 28, 3865-3897, 2000.
10. K. Potanka, Groups, graphs and symmetry breaking, Masters Thesis, Department of Mathematics, Virginia Polytechnic Institute, 1998.
11. A. Russell and R. Sundaram, A note on the asymptotics and computational complexity of graph distinguishability, Electronic Journal of Combinatorics 5 (1998) R23.
12. J. Tymoczko, Distinguishing numbers for graphs and groups, Electronic Journal of Combinatorics 11 (1) (2004) R63.