Almost all steinhaus graphs have diameter 2

DOI10.1002/jgt.3190160304zbMath0772.05066OpenAlexW2131815672MaRDI QIDQ4013423

Neal Brand

Publication date: 27 September 1992

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190160304

zbMATH Keywords

diameteradjacency matrixSteinhaus graphBrigham and Dutton's conjecture

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (6)

Generating strings for bipartite Steinhaus graphs ⋮ The diameters of almost all Cayley digraphs ⋮ Properties of Classes of Random Graphs ⋮ Probability of diameter two for Steinhaus graphs ⋮ Unnamed Item ⋮ Characterizations of bipartite Steinhaus graphs

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Almost all steinhaus graphs have diameter 2