Distinguishing cartesian powers of graphs

Journal of Graph Theory

Volumn 53, Issue 3, 2006, Pages 250-260

  Imrich, Wilfried ^a   Klavžar, Sandi ^b,c  

^a UNIVERSITY OF LEOBEN   (Austria)

^b UNIVERSITY OF MARIBOR   (Slovenia)

^c and Mechanics   (Slovenia)

Author keywords

Distinguishing number; Graph automorphism; Products of graphs

Indexed keywords

INTEGER PROGRAMMING; NUMBER THEORY; PROBLEM SOLVING;

DISTINGUISHING NUMBERS; GRAPH AUTOMORPHISM; PRODUCTS OF GRAPHS;

GRAPH THEORY;

EID: 33750475974     PISSN: 03649024     EISSN: 10970118     Source Type: Journal    
DOI: 10.1002/jgt.20190     Document Type: Article

References (20)

1. M. O. Albertson, Distinguishing Cartesian powers of graphs, Electron J Combin 12 (2005), #N17.
2. M. O. Albertson and K. L. Collins, Symmetry breaking in graphs, Electron J Combin 3 (1996), #R18.
3. B. Bogstad and L. Cowen, The distinguishing number of hypercubes, Discrete Math 283 (2004), 29-35.
4. M. Chan, The distinguishing number of the augmented cube and hypercube powers, submitted to Discrete Math.
5. M. Chan, The distinguishing number of the direct and wreath product action, to appear in J. Algebraic Comb.
6. W. Dörfler and W. Imrich, Über das starke Produkt von endlichen Graphen, Österreich Akad Wiss Math-Natur Kl S-B II 178 (1970), 247-262.
7. C. T. Cheng and L. J. Cowen, On the local distinguishing numbers of cycles, Discrete Math 196 (1999), 97-108.
8. T. Feder, Product graph representations, J Graph Theory 16 (1992), 467-488.
9. J. Feigenbaum and A. A. Schäffer, Finding the prime factors of strong direct product graphs in polynomial time, Discrete Math 109 (1992), 77-102.
10. W. Imrich, Kartesisches Produkt von Mengensystemen und Graphen, Studia Sci Math Hungar 2 (1967), 285-290.
11. W. Imrich, Factoring cardinal product graphs in polynomial time, Discrete Math 192 (1998), 119-144.
12. W. Imrich and S. Klavžar, Product Graphs: Structure and Recognition, John Wiley & Sons, New York, 2000.
13. S. Klavžar, T.-L. Wong, and X. Zhu, Distinguishing labelings of group action on vector spaces and graphs, to appear in J Algebra (2006), in press.
14. S. Klavžar and X. Zhu, Cartesian prowers of graphs can be distinguished by two labels, European J Combin, 27(2006), in press.
15. R. McKenzie, Cardinal multiplication of structures with a reflexive relation, Fund Math 70 (1971), 59-101.
16. A. Russell and R. Sundaram, A note on the asymptotics and computational complexity of graph distinguishability, Electron J Combin 5 (1998), #R23.
17. G. Sabidussi, Graph multiplication, Math Z 72 (1960), 446-457.
18. J. Tymoczko, Distinguishing numbers for graphs and groups, Electron J Combin 11 (2004), #R63, 13.
19. V. G. Vizing, Cartesian product of graphs, Vychisl Sistemy (in Russian) 9 (1963), 30-43;
20. English translation: Comp El Syst 2 (1966), 352-365.