Characterizations of bipartite Steinhaus graphs

DOI10.1016/S0012-365X(98)00282-9zbMath0930.05080WikidataQ126572867 ScholiaQ126572867MaRDI QIDQ1297427

V. Pereyra

Publication date: 18 January 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

recursive sequenceSteinhaus graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (5)

Balanced simplices ⋮ Parity-regular Steinhaus graphs ⋮ Symmetric binary Steinhaus triangles and parity-regular Steinhaus graphs ⋮ Unnamed Item ⋮ Regular Steinhaus graphs of odd degree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probability of diameter two for Steinhaus graphs
• Graphs without short odd cycles are nearly bipartite
• Generating strings for bipartite Steinhaus graphs
• Solution of Steinhaus's problem with plus and minus signs
• Almost all steinhaus graphs have diameter 2
• Steinhaus graphs
• Properties of Classes of Random Graphs
• Binomial Coefficients Modulo a Prime
• Bipartite Steinhaus graphs

This page was built for publication: Characterizations of bipartite Steinhaus graphs