Distance and size in digraphs

DOI10.1016/j.disc.2014.08.028zbMath1301.05097OpenAlexW2082074125MaRDI QIDQ468452

Peter Dankelmann

Publication date: 7 November 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.08.028

zbMATH Keywords

diameterradiusEulerian digraphout-radius

Mathematics Subject Classification ID

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

Related Items (6)

Maximum size of digraphs with some parameters ⋮ Maximum size of digraphs of given radius ⋮ Diameter and maximum degree in Eulerian digraphs ⋮ On average distance in tournaments and Eulerian digraphs ⋮ Size of graphs and digraphs with given diameter and connectivity constraints ⋮ The eccentricity matrix of a digraph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of edges in a bipartite graph of given radius
• The diameter of almost Eulerian digraphs
• The diameter of directed graphs
• Maximum diameter of regular digraphs
• Diameters in graphs

This page was built for publication: Distance and size in digraphs