Title of article
Extremal cliques in Steinhaus graphs
Author/Authors
Lim، نويسنده , , Daekeun، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
6
From page
1912
To page
1917
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 + 3 3 ⌉ , which is the maximum possible. Also, we give the number of such Steinhaus graphs with n vertices.
Keywords
partner , clique , Doubly symmetric , Steinhaus graph , Generating string
Journal title
Discrete Mathematics
Serial Year
2010
Journal title
Discrete Mathematics
Record number
1598301
Link To Document