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

Pascal Triangle and Properties of Bipartite Steinhaus Graphs

0

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

In this paper, we investigate the number of ones in rows of Pascal’s Rectangle. Using these results, we determine the existence of regular bipartite Steinhaus graphs. Also, we give an upper bound for the minimum degree of bipartite Steinhaus graphs.

Abstract

In this paper, we investigate the number of ones in rows of Pascal’s Rectangle. Using these results, we determine the existence of regular bipartite Steinhaus graphs. Also, we give an upper bound for the minimum degree of bipartite Steinhaus graphs.

참고문헌 (9)

  1. B. Bollobas, "Graph Theory" (1979), Springer-Verlag, New York
  2. C. K. Bailey, "Regular Steinhaus graphs", Congr. Numer, 66, pp.45~47 (1988)
  3. W. M. Dymacek, "Bipartite Steinhaus graphs", Discrete Mathematics, 59, pp.9~22 (1986)
  4. W. M. Dymacek, "Generating strings for bipartite Steinhaus graphs", Discrete Mathematics, 141(1), pp.95~107 (1995)
  5. W. M. Dymacek, "A survey of Steinhaus graphs, Proceedings of the Eihgth Quadrennial Intrnational Conference on Graph Theory", Combinatorics Algorithm and Applications, 1, pp.313~323 (1998)
  6. G. J. Chang, "Characterizations of bipartite Steinhaus graphs", Discrete Mathematics, 199, pp.11~25 (1999)
  7. H. Harborth, "Solution of Steinhaus's problem with plus and minus signs", J. Combinatorial Theory, 12(A), pp.253~259 (1972)
  8. R. Stanley, "Enumerative Combinatorics Volume I" (1986), Wadsworth, Inc
  9. H. Steinhaus, "One Hundred Problems in Elementary Mathematics", Dover, New York, ~ (1979)

관련 논문AI추천

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