MAXIMAL INDUCED CYCLES IN STEINHAUS GRAPHS

  • 발행 : 1996.10.01

초록

In this paper, we introduce some properties of Steinhaus graphs of order n, and prove that the size of some special type of induced cycles in Steinhaus graphs of order n is bounded by $\left\lfloor \frac{n+3}{2} \right\rfloor$.

키워드