MAXIMAL INDUCED CYCLES IN STEINHAUS GRAPHS

  • Published : 1996.10.01

Abstract

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$.

Keywords