| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649272 | Discrete Mathematics | 2010 | 6 Pages |
Abstract
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+33â, which is the maximum possible. Also, we give the number of such Steinhaus graphs with n vertices.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Daekeun Lim,