Generating strings for bipartite Steinhaus graphs (Q1894762): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4733882 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Almost all steinhaus graphs have diameter 2 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5283983 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3037444 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complements of Steinhaus graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bipartite Steinhaus graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Binomial Coefficients Modulo a Prime / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solution of Steinhaus's problem with plus and minus signs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Steinhaus graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3665189 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2816149 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Divisibility - with visibility / rank | |||
Normal rank |
Revision as of 15:54, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Generating strings for bipartite Steinhaus graphs |
scientific article |
Statements
Generating strings for bipartite Steinhaus graphs (English)
0 references
18 December 1995
0 references
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\).
0 references
strings
0 references
bipartite graphs
0 references
counting
0 references
Steinhaus graphs
0 references