Maximum diameter of regular digraphs

DOI10.1002/JGT.3190160505MaRDI QIDQ4020701zbMATH OpenOpenAlexFDO

Authors

Publication date 17 January 1993

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

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

zbMATH Keywords

diameterregular digraphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Cites work

• An application of connectivity theory in graphs to factorizations of elements in groups

Cited in

(10)

• Formally verified algorithms for upper-bounding state space diameters
• The diameter of directed graphs
• On average distance in tournaments and Eulerian digraphs
• Size of graphs and digraphs with given diameter and connectivity constraints
• Diameter of some monomial digraphs
• Capturing the drunk robber on a graph
• Distance and size in digraphs
• Minimum orders of Eulerian oriented digraphs with given diameter
• Minimum algebraic connectivity and maximum diameter: Aldous-Fill and Guiduli-Mohar conjectures
• Diameter and maximum degree in Eulerian digraphs

This page was built for publication: Maximum diameter of regular digraphs

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