Almost all steinhaus graphs have diameter 2

DOI10.1002/JGT.3190160304zbMATH Open0772.05066OpenAlexW2131815672MaRDI QIDQ4013423FDOQ4013423

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

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

zbMATH Keywords

adjacency matrixdiameterSteinhaus graphBrigham and Dutton's conjecture

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• Properties of Classes of Random Graphs
• The diameters of almost all Cayley digraphs
• Generalized steinhaus graphs
• Title not available (Why is that?)
• 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)