Title of article
Characterizations of bipartite Steinhaus graphs Original Research Article
Author/Authors
Gerard J. Chang، نويسنده , , Bhaskar DasGupta، نويسنده , , Wayne M. Dymà?ek، نويسنده , , Martin Furer، نويسنده , , Matthew Koerlin، نويسنده , , Yueh-Shin Lee، نويسنده , , Tom Whaley، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
15
From page
11
To page
25
Abstract
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion had previously been given for the number of bipartite Steinhaus graphs and we give two fascinating closed forms for this recursion. Also, we exhibit a lower bound, which is achieved infinitely often, for the number of bipartite Steinhaus graphs.
Keywords
Steinhaus graph , Recursive sequence , Bipartite Steinhaus graph
Journal title
Discrete Mathematics
Serial Year
1999
Journal title
Discrete Mathematics
Record number
950769
Link To Document