Almost all steinhaus graphs have diameter 2

DOI10.1002/JGT.3190160304MaRDI QIDQ4013423zbMATH OpenOpenAlexFDO

Authors 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

adjacency matrixdiameterSteinhaus graphBrigham and Dutton's conjecture

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 975321
• Probability of diameter two for Steinhaus graphs
• Parity-regular Steinhaus graphs
• scientific article; zbMATH DE number 1457363
• Regular Steinhaus graphs of odd degree

Cited in

(7)

• The diameters of almost all Cayley digraphs
• Properties of Classes of Random Graphs
• Generalized steinhaus graphs
• scientific article; zbMATH DE number 2230278 (Why is no real title available?)
• Characterizations of bipartite Steinhaus graphs
• Probability of diameter two for Steinhaus graphs
• Generating strings for bipartite Steinhaus graphs

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

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