Characterizations of bipartite Steinhaus graphs

Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dymàček, Martin Fürer, Matthew Koerlin, Yueh Shin Lee, Tom Whaley

    Research output: Contribution to journalArticlepeer-review

    4 Scopus citations

    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.

    Original languageEnglish (US)
    Pages (from-to)11-25
    Number of pages15
    JournalDiscrete Mathematics
    Volume199
    Issue number1-3
    DOIs
    StatePublished - Mar 28 1999

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Discrete Mathematics and Combinatorics

    Fingerprint Dive into the research topics of 'Characterizations of bipartite Steinhaus graphs'. Together they form a unique fingerprint.

    Cite this