scientific article; zbMATH DE number 890664

MaRDI QIDQ4882548zbMATH OpenFDO

Authors E. T. Baskoro, Mirka Miller

Publication date 18 June 1996

zbMATH Keywords

distancediameterMoore boundMoore digraphstrongly geodetic digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Recommendations

• Minimum Diameter of Diregular Digraphs of Degree 2
• Construction Techniques for Digraphs with Minimum Diameter
• Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter
• Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter. II

Cited in

(6)

• The optimal diameter of \(2\)-circulant digraphs
• Construction Techniques for Digraphs with Minimum Diameter
• scientific article; zbMATH DE number 91052 (Why is no real title available?)
• Minimum Diameter of Diregular Digraphs of Degree 2
• scientific article; zbMATH DE number 5994744 (Why is no real title available?)
• Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter

This page was built for publication:

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