Generating strings for bipartite Steinhaus graphs
type: Item
instance of: scholarly article
title: Generating strings for bipartite Steinhaus graphs
zbMATH Open document ID: 0828.05038
DOI: 10.1016/0012-365X(93)E0211-L
author: Yanyan Li
published in: Discrete Mathematics
publication date: 1995-12-18T00:00:00Z
review text: If \(b(n)\) is the number of bipartite Steinhaus graphs with \(n\) vertices, the authors prove the recurrence relations \(b(2)= 2\), \(b(3)= 4\) and \(b(2k)= b(k)+ b(k+ 1)\), \(b(2k+ 1)= 2b(k+ 1)+ 1\) for any \(k\geq 2\). Whence, they derive that \(b(n)\leq (5n- 7)/2\), with equality if \(n\) has the form \(2^m+ 1\) for some integer \(m\).
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C30
zbMATH DE Number: 778528
zbMATH Keywords: strings
zbMATH Keywords: bipartite graphs
zbMATH Keywords: counting
zbMATH Keywords: Steinhaus graphs
reviewed by: Aleksandar Torgašev
MaRDI profile type: Publication
cites work: Q4733882
cites work: Almost all steinhaus graphs have diameter 2
cites work: Q5283983
cites work: Q3037444
cites work: Complements of Steinhaus graphs
cites work: Bipartite Steinhaus graphs
cites work: Binomial Coefficients Modulo a Prime
cites work: Solution of Steinhaus's problem with plus and minus signs
cites work: Steinhaus graphs
cites work: Q3665189
cites work: One hundred problems in elementary mathematics. With a foreword by Martin Gardner
cites work: Divisibility - with visibility
full work available at URL: 0012-365x(93)e0211-l
OpenAlex ID: W1987516675
description: scientific article; zbMATH DE number 778528