Generating strings for bipartite Steinhaus graphs

DOI10.1016/0012-365X(93)E0211-LMaRDI QIDQ1894762zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 18 December 1995

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(93)e0211-l

zbMATH Keywords

bipartite graphscountingSteinhaus graphsstrings

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

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\).

Recommendations

• Characterizations of bipartite Steinhaus graphs
• Parity-regular Steinhaus graphs
• Bipartite Steinhaus graphs
• Bipartite Steinhaus graphs
• Extremal cliques in Steinhaus graphs

Cites work

• Almost all steinhaus graphs have diameter 2
• Binomial Coefficients Modulo a Prime
• Bipartite Steinhaus graphs
• Complements of Steinhaus graphs
• Divisibility - with visibility
• scientific article; zbMATH DE number 3829920 (Why is no real title available?)
• scientific article; zbMATH DE number 3817794 (Why is no real title available?)
• scientific article; zbMATH DE number 4120200 (Why is no real title available?)
• scientific article; zbMATH DE number 975321 (Why is no real title available?)
• One hundred problems in elementary mathematics. With a foreword by Martin Gardner
• Solution of Steinhaus's problem with plus and minus signs
• Steinhaus graphs

Cited in

(4)

• Regular Steinhaus graphs of odd degree
• Characterizations of bipartite Steinhaus graphs
• Symmetric binary Steinhaus triangles and parity-regular Steinhaus graphs
• Balanced simplices

This page was built for publication: Generating strings for bipartite Steinhaus graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894762)