Document Type : Original Scientific Paper

**Authors**

Department of Mathematics, Yazd University, Yazd, Iran

**Abstract**

The distinguishing number (index) D(G) (D'(G)) of a graph G is the least integer d such that G has an vertex labeling (edge labeling) with d labels that is preserved only by a trivial automorphism. In this paper we study the distinguishing number and the distinguishing index of the join of two graphs G and H, i.e., G+H. We prove that 0≤ D(G+H)-max{D(G),D(H)}≤ z, where z depends on the number of some induced subgraphs generated by some suitable partitions of V(G) and V(H). Let G^{k} be the k-th power of G with respect to the join product. We prove that if G is a connected graph of order n ≥ 2, then G^{k} has the distinguishing index 2, except D'(K_{2}+K_{2})=3.

**Keywords**

[2] M. O. Albertson and K. L. Collins, Symmetry breaking in graphs, Electron. J. Combin.

[3] S. Alikhani and S. Soltani, Distinguishing number and distinguishing index of certain graphs, Filomat

[4] B. Bogstad and L. J. Cowen, The distinguishing number of the hypercube, Discrete Math.

[5] M. J. Fisher and G. Isaak, Distinguishing colorings of Cartesian products of complete graphs, Discrete Math.

[6] R. Hammack, W. Imrich and S. Klavžar, Handbook of Product Graphs, Chapman and Hall/CRC, 2011.

[7] W. Imrich, J. Jerebic and S. Klavžar, The distinguishing number of Cartesian products of complete graphs, European J. Combin.

[8] R. Kalinowski and M. Pilsniak, Distinguishing graphs by edge-colourings, European J. Combin.

[9] S. Klavžar and X. Zhu, Cartesian powers of graphs can be distinguished by two labels, European J. Combin.

[10] M. Pilsniak, Improving upper bounds for the distinguishing index, Ars Math. Contemp.

December 2019

Pages 239-251