Extremal cliques in Steinhaus graphs

In this paper, we define four types of clique in Steinhaus graphs and classify the generating strings of those n -vertex Steinhaus graphs whose maximum cliques have size ⌈ n + 3 3 ⌉ , which is the maximum possible. Also, we give the number of such Steinhaus graphs with n vertices.