On computing the distinguishing numbers of trees and forests

Electronic Journal of Combinatorics

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

  Cheng, Christine T ^a  

^a University of Wisconsin Milwaukee   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 32544452178     PISSN: 10778926     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/1037     Document Type: Article

References (13)

1. A. Aho, J. Hopcroft, and J. Ullman. The Design and Analysis of Algorithms. Addison-Wesley, 1974.
2. M. Albertson and M. Collins. Symmetry breaking in graphs. Electronic Journal of Combinatorics, 3:R18, 1996.
3. W. Bogstad and L. Cowen. The distinguishing number of the hypercube. Discrete Mathematics, 283:29-35, 2004.
4. M. Chan. The distinguishing number of the augmented cube and hypercube powers. Submitted.
5. M. Chan. The distinguishing number of the direct product and wreath product action. To appear in the Journal of Algebraic Combinatorics.
6. M. Chan. The maximum distinguishing number of a group. To appear in the Electronic Journal of Combinatorics.
7. M. Goodrich and R. Tamassia. Algorithm Design. John Wiley and Sons, Inc., 2001.
8. S. Klavžar, T. Wong, and X. Zhu. Distinguishing labelings of group action on vector spaces and graphs. To appear in the Journal of Algebra.
9. J. Köbler, U. Scheming, and J. Torán. The Graph Isomorphism Problem: Its Structural Complexity. Birkhäuser, 1993.
10. K. Potanka. Groups, graphs and symmetry-breaking. Master's thesis, Virginia Polytechnic Institute and State University, 1998.
11. F. Rubin. Problem 729. Journal of Recreational Mathematics, 11:128, 1979.
12. A. Russell and R. Sundaram. A note on the asymptotics and computational complexity of graph distinguishability. Electronic Journal of Combinatorics, 5:R23, 1998.
13. J. Tymoczko. Distinguishing numbers for graphs and groups. Electronic Journal of Combinatorics, 11(1):R63, 2004.