본문 바로가기
KERD
논문KCI 등재

THE DISTINGUISHING NUMBERS OF MERGED JOHNSON GRAPHS

1

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

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.

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.

참고문헌 (12)

  1. M. O. Albertson, "Distinguishing geometric graphs", J. Graph Theory, 53(2), pp.135~150 (2006)
  2. M. O. Albertson, "Using determining sets to distinguish Kneser graphs", Electron. J. Combin, 14(1), pp.9~ (2007)
  3. M. O. Albertson, "Symmetry breaking in graphs", Electron. J. Combin, 3(1), pp.17~ (1996)
  4. B. Bogstad, "The distinguishing number of the hypercube", Discrete Math, 283(1-3), pp.29~35 (2004)
  5. M. Chan, "The distinguishing number of the direct product and wreath product action", J. Algebraic Combin, 24(3), pp.331~345 (2006)
  6. J. Dixon, "Permutation Groups" (1996), Springer
  7. M. J. Fisher, "Distinguishing colorings of Cartesian products of complete graphs", Discrete Math, 308(11), pp.2240~2246 (2008)
  8. W. Imrich, "Distinguishing Cartesian powers of graphs", J. Graph Theory, 53(3), pp.250~260 (2006)
  9. G. A. Jones, "Automorphisms and regular embeddings of merged Johnson graphs", Euro-pean J. Combin, 26(3-4), pp.417~435 (2005)
  10. S. Klavzar, "Cartesian powers of graphs can be distinguished by two labels", European J. Combin, 28(1), pp.303~310 (2007)
  11. T. L. Wong, "Distinguishing labeling of group actions", Discrete Math, 309(6), pp.1760~1765 (2009)

관련 논문AI추천

이 간행물의 다른 논문 (28건)