Minimum Diameter of Diregular Digraphs of Degree 2

DOI10.1093/COMJNL/31.1.71MaRDI QIDQ3770562zbMATH OpenOpenAlexFDO

Authors Mirka Miller, Ivan Friš

Publication date 1988

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/31.1.71

zbMATH Keywords

-diregular digraphboundsmaximum orderminimum diameter

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 890664
• scientific article; zbMATH DE number 91052
• scientific article; zbMATH DE number 637285
• On diregular digraphs with degree two and excess two
• scientific article; zbMATH DE number 426169

Cited in

(11)

• On diameters of 2-regular graphs
• On the existence of \((d,k)\)-digraphs
• A characterization of the non-trivial diameter two graphs of minimum size
• Enumerations of vertex orders of almost Moore digraphs with selfrepeats
• The optimal diameter of \(2\)-circulant digraphs
• scientific article; zbMATH DE number 4008431 (Why is no real title available?)
• scientific article; zbMATH DE number 3997831 (Why is no real title available?)
• Minimum orders of Eulerian oriented digraphs with given diameter
• scientific article; zbMATH DE number 890664 (Why is no real title available?)
• APPLICATIONS OF LINKING INEQUALITIES TO AN ASYMMETRIC BEAM EQUATION
• Graphs of order two less than the Moore bound

This page was built for publication: Minimum Diameter of Diregular Digraphs of Degree 2

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