Author/Authors :
Gerard J. Chang، نويسنده , , Bhaskar DasGupta، نويسنده , , Wayne M. Dymà?ek، نويسنده , , Martin Furer، نويسنده , , Matthew Koerlin، نويسنده , , Yueh-Shin Lee، نويسنده , , Tom Whaley، نويسنده ,
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.
