The distinguishing number of the hypercube

Discrete Mathematics

Volumn 283, Issue 1-3, 2004, Pages 29-35

  Bogstad, Bill ^a   Cowen, Lenore J ^a  

^a Tufts University   (United States)

Author keywords

Automorphism groups; Distinguishing number; Graph coloring; Hypercube; Symmetry breaking

Indexed keywords

COLOR; COMPUTER SIMULATION; FUNCTIONS; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; VECTORS;

AUTOMORPHISM GROUPS; DISTINGUISHING NUMBER; GRAPH COLORING; HYPERCUBE; SYMMETRY BREAKING;

GRAPH THEORY;

EID: 2442703225     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2003.11.018     Document Type: Article

References (5)

1. Albertson M., Collins K. Symmetry breaking in graphs. Electron. J. Combin. 3:1996.
2. C.C.T. Cheng, Three problems in graph labeling, Ph.D. Thesis, Department of Mathematical Sciences, Johns Hopkins University, 1999.
3. Cheng C.C.T., Cowen L.J. On the local distinguishing number of cycles. Discrete Math. 196:1999;97-108.
4. K. Potanka, Groups, graphs and symmetry breaking, Masters Thesis, Department of Mathematics, Virginia Polytechnic Institute, 1998.
5. Russell A., Sundaram R. A note on the asymptotics and computational complexity of graph distinguishability. Electron. J. Combin. 5:1998.