Communications of the Korean Mathematical Society (대한수학회논문집)

Korean Mathematical Society (대한수학회)
권호 표지

HAMILTONIANS IN STEINHAUS GRAPHS

  • Lim, Dae-Keun (Department of Mathematics, Keimyung University) ;
  • Kim, Hye-Kyung (Department of Mathematics, Catholic University of Taegu Hyosung)
  • Published : 1996.10.01
Download PDF
⟨ Previous Next ⟩

Abstract

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.

Keywords