Characterizations of bipartite Steinhaus graphs

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

doi:10.1016/S0012-365X(98)00282-9

Characterizations of bipartite Steinhaus graphs

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

Eberly College of Science

Research output: Contribution to journal › Article › peer-review

6 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 language	English (US)
Pages (from-to)	11-25
Number of pages	15
Journal	Discrete Mathematics
Volume	199
Issue number	1-3
DOIs	https://doi.org/10.1016/S0012-365X(98)00282-9
State	Published - Mar 28 1999

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/S0012-365X(98)00282-9

Cite this

@article{cdf534f9c1f14579a3e80c14506b6757,

title = "Characterizations of bipartite Steinhaus graphs",

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.",

author = "Chang, \{Gerard J.\} and Bhaskar DasGupta and Dym{\`a}{\v c}ek, \{Wayne M.\} and Martin F{\"u}rer and Matthew Koerlin and Lee, \{Yueh Shin\} and Tom Whaley",

note = "Funding Information: * Corresponding author. E-mail: [email protected]. {\textquoteright} Supported in part by the National Science Council under grant NSC83-0208-M009-050. {\textquoteright} Research supported in part by NSF grant CCR-92-00270. {\textquoteright} Research supported in part by a Washington and Lee University Glenn Grant. 4 Research supported in part by NSF grants CCR-92-18309, CCR-9700053. {\textquoteright} Research supported in part by a Council on Undergraduate Research Summer Opportunities Fellowship Award. {\textquoteleft}This paper contains parts of Y.S. Lee{\textquoteright}s master thesis,",

year = "1999",

month = mar,

day = "28",

doi = "10.1016/S0012-365X(98)00282-9",

language = "English (US)",

volume = "199",

pages = "11--25",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "1-3",

}

TY - JOUR

T1 - Characterizations of bipartite Steinhaus graphs

AU - Chang, Gerard J.

AU - DasGupta, Bhaskar

AU - Dymàček, Wayne M.

AU - Fürer, Martin

AU - Koerlin, Matthew

AU - Lee, Yueh Shin

AU - Whaley, Tom

N1 - Funding Information: * Corresponding author. E-mail: [email protected]. ’ Supported in part by the National Science Council under grant NSC83-0208-M009-050. ’ Research supported in part by NSF grant CCR-92-00270. ’ Research supported in part by a Washington and Lee University Glenn Grant. 4 Research supported in part by NSF grants CCR-92-18309, CCR-9700053. ’ Research supported in part by a Council on Undergraduate Research Summer Opportunities Fellowship Award. ‘This paper contains parts of Y.S. Lee’s master thesis,

PY - 1999/3/28

Y1 - 1999/3/28

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0043209370

UR - https://www.scopus.com/pages/publications/0043209370#tab=citedBy

U2 - 10.1016/S0012-365X(98)00282-9

DO - 10.1016/S0012-365X(98)00282-9

M3 - Article

AN - SCOPUS:0043209370

SN - 0012-365X

VL - 199

SP - 11

EP - 25

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

Characterizations of bipartite Steinhaus graphs

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this