Distinguishing Cartesian powers of graphs

Electronic Journal of Combinatorics

Volumn 12, Issue 1 N, 2005, Pages

  Albertson, Michael O ^a  

^a SMITH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 25444432818     PISSN: 10778926     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/1984     Document Type: Article

References (6)

1. Michael O. Albertson and Karen L. Collins, Symmetry breaking in graphs. Electronic J. Combinatorics 3 (1996) #R18.
2. Bill Bogstad and Lenore J. Cowen The distinguishing number of the hypercube. Discrete Math. 283 (2004), no. 1-3, 29-35.
3. Ronald Graham, Isometric embeddings of graphs, in Selected Topics in Graph Theory 3, Academic Press, San Diego CA, 1988, 133-150.
4. Wilfried Imrich and Sandi Klavžar, Product Graphs, John Wiley & Sons, Inc. New York, 2000.
5. Frank Rubin, Problem 729: the blind man's keys, Journal of Recreational Mathematics, 11(2) (1979), 128, solution in 12(2) (1980).
6. Alexander Russell and Ravi Sundaram, A note on the asymptotics and computational complexity of graph distinguishability. Electronic Journal of Combinatorics, 5 (1998) #R2.