Cartesian powers of graphs can be distinguished by two labels

European Journal of Combinatorics

Volumn 28, Issue 1, 2007, Pages 303-310

  Klavžar, Sandi ^a   Zhu, Xuding ^b,c  

^a UNIVERSITY OF MARIBOR   (Slovenia)

^b NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

^c NATIONAL CENTER FOR THEORETICAL SCIENCES   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33748912999     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2005.07.001     Document Type: Article

References (11)

1. M.O. Albertson, Distinguishing powers of graphs, February 2005 (manuscript)
2. Albertson M.O., and Collins K.L. Symmetry breaking in graphs. Electron. J. Combin. 3 (1996) R18
3. Bogstad B., and Cowen L. The distinguishing number of hypercubes. Discrete Math. 283 (2004) 29-35
4. Godsil C., and Royle G. Algebraic Graph Theory (2001), Springer, New York
5. Imrich W., and Izbicki H. Associative products of graphs. Monatsh. Math. 80 (1975) 277-281
6. Imrich W., and Klavžar S. Product Graphs: Structure and Recognition (2000), John Wiley & Sons, New York
7. W. Imrich, S. Klavžar, Distinguishing Cartesian powers of graphs (manuscript)
8. Russell A., and Sundaram R. A note on the asymptotics and computational complexity of graph distinguishability. Electron. J. Combin. 5 (1998) R23
9. Sabidussi G. Graph multiplication. Math. Z. 72 (1960) 446-457
10. Vizing V.G. Cartesian product of graphs. Vychisl. Sistemy 9 (1963) 30-43 (in Russian)
11. Vizing V.G. Cartesian product of graphs. Comp. El. Syst. 2 (1966) 352-365 (English transl.)