• 제목/요약/키워드: (p,alpha)-jumbled graph

검색결과 1건 처리시간 0.014초

HAMILTONIANS IN STEINHAUS GRAPHS

  • Lim, Dae-Keun;Kim, Hye-Kyung
    • 대한수학회논문집
    • /
    • 제11권4호
    • /
    • pp.1137-1145
    • /
    • 1996
  • A Steinhaus graph is a labelled graph whose adjacency matrix $A = (a_{i,j})$ has the Steinhaus property : $a_{i,j} + a{i,j+1} \equiv a_{i+1,j+1} (mod 2)$. We consider random Steinhaus graphs with n labelled vertices in which edges are chosen independently and with probability $\frac{1}{2}$. We prove that almost all Steinhaus graphs are Hamiltonian like as in random graph theory.

  • PDF