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

DOMINATIONS ON BIPARTITE STEINHAUS GRAPHS

1

조회

0

다운로드

0

인용

0

참고문헌

주제분류수학

초록

In this paper, we give an upper bound for dominations of Steinhaus graphs, and the domination numbers of the bipartite Steinhaus graphs. Also, we give an upper bound for Nordhaus-Gaddum type result for the bipartite Steinhaus graphs.

Abstract

In this paper, we give an upper bound for dominations of Steinhaus graphs, and the domination numbers of the bipartite Steinhaus graphs. Also, we give an upper bound for Nordhaus-Gaddum type result for the bipartite Steinhaus graphs.

참고문헌 (9)

  1. B. Bollobas, "Graph Theory" (1979), Springer-Verlag
  2. W. M. Dymacek, "Bipartite Steinhaus graphs", Discrete Mathematics, 59, pp.9~22 (1986)
  3. W. M. Dymacek, "Generating strings for bipartite Steinhaus graphs", Discrete Mathematics, 141(1), pp.95~107 (1995)
  4. W. M. Dymacek, "A survey of Steinhaus graphs", Proceedings of the Eighth Quadrennial International Conference on Graph Theory, Combinatorics, Algorithm and Applications, pp.313~323 (1998)
  5. G. J. Chang, "Characterizations of bipartite Steinhaus graph", Discrete Mathematics, 199, pp.11~25 (1999)
  6. H. Harborth, "Solution of Steinhaus's problem with plus and minus signs", J. Combina-torial Theory, 12, pp.253~259 (1972)
  7. T. W. Haynes, "Fundamentals of Domination in Graphs" (1998), Marcel Dekker
  8. D. Lim, "Upper bound on domination number of Steinhaus graphs", J. Inst. Nat. Sci., 12(2), pp.9~14 (2007)
  9. R. Stanley, "Enumerative Combinatorics Vol. I", pp.1986, Wadsworth and Brooks

관련 논문AI추천

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