Characterizations of bipartite Steinhaus graphs

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. Key words: Steinhaus graph, bipartite Steinhaus graph, recursive sequence Preprint submitted to Elsevier Preprint 11 May 1998 

• Type: Journal
• Year: 1999
• Where: DM
• Authors: Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dymàcek, Martin Fürer, Matthew Koerlin, Yueh-Shin Lee, Tom Whaley
• Keywords: Bipartite Steinhaus Graph, DM 1999, Interesting Recursion, Lower Bound