Browse > Article
http://dx.doi.org/10.4134/BKMS.2015.52.2.395

THE DISTINGUISHING NUMBERS OF MERGED JOHNSON GRAPHS  

Kim, Dongseok (Department of Mathematics Kyonggi University)
Kwon, Young Soo (Department of Mathematics Yeungnam University)
Lee, Jaeun (Department of Mathematics Yeungnam University)
Publication Information
Bulletin of the Korean Mathematical Society / v.52, no.2, 2015 , pp. 395-408 More about this Journal
Abstract
In present article, we determine the distinguishing number of the merged Johnson graphs which are generalization of both the Kneser graphs and the Johnson graphs.
Keywords
distinguishing numbers; merged Johnson graphs;
Citations & Related Records
연도 인용수 순위
  • Reference
1 M. O. Albertson and K. L. Collins, Symmetry breaking in graphs, Electron. J. Combin. 3 (1996), no. 1, Research paper 18, 17 pp.
2 B. Bogstad and L. J. Cowen, The distinguishing number of the hypercube, Discrete Math. 283 (2004), no. 1-3, 29-35.   DOI   ScienceOn
3 M. Chan, The distinguishing number of the direct product and wreath product action, J. Algebraic Combin. 24 (2006), no. 3, 331-345.   DOI
4 J. Dixon and B. Mortimer, Permutation Groups, Springer, GTM 163, 1996.
5 M. J. Fisher and G. Isaak, Distinguishing colorings of Cartesian products of complete graphs, Discrete Math. 308 (2008), no. 11, 2240-2246.   DOI   ScienceOn
6 W. Imrich and S. Klavzar, Distinguishing Cartesian powers of graphs, J. Graph Theory 53 (2006), no. 3, 250-260.   DOI   ScienceOn
7 G. A. Jones, Automorphisms and regular embeddings of merged Johnson graphs, Euro-pean J. Combin. 26 (2005), no. 3-4, 417-435.   DOI   ScienceOn
8 S. Klavzar and X. Zhu, Cartesian powers of graphs can be distinguished by two labels, European J. Combin. 28 (2007), no. 1, 303-310.   DOI   ScienceOn
9 T. L. Wong and X. Zhu, Distinguishing labeling of group actions, Discrete Math. 309 (2009), no. 6, 1760-1765.   DOI   ScienceOn
10 T. Van Zandt, PSTricks: PostScript macros for generic TEX, Available at ftp://ftp.princeton.edu/pub/tvz/.
11 M. O. Albertson and D. L. Boutin, Distinguishing geometric graphs, J. Graph Theory 53 (2006), no. 2, 135-150.   DOI   ScienceOn
12 M. O. Albertson and D. L. Boutin, Using determining sets to distinguish Kneser graphs, Electron. J. Combin. 14 (2007), no. 1, Research paper 20, 9 pp.