Generating strings for bipartite Steinhaus graphs

DOI10.1016/0012-365X(93)E0211-LzbMath0828.05038OpenAlexW1987516675MaRDI QIDQ1894762

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

countingbipartite graphsstringsSteinhaus graphs

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Divisibility - with visibility
• Complements of Steinhaus graphs
• Solution of Steinhaus's problem with plus and minus signs
• Almost all steinhaus graphs have diameter 2
• Steinhaus graphs
• Binomial Coefficients Modulo a Prime
• Bipartite Steinhaus graphs