Maximum size of digraphs of given radius

DOI10.1016/j.disc.2023.113429zbMath1515.05057arXiv2201.00186OpenAlexW4362638219MaRDI QIDQ6041555

Stijn Cambie

Publication date: 31 May 2023

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

Full work available at URL: https://arxiv.org/abs/2201.00186

zbMATH Keywords

extremal problemsstrong digraphsmaximum sizeoutradius

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Cites Work

• Unnamed Item
• Unnamed Item
• Distance and size in digraphs
• The number of edges in a bipartite graph of given radius
• Minimum size of a graph or digraph of given radius
• Wiener index of graphs with radius two
• An asymptotic resolution of a problem of Plesník
• On the sum of all distances in a graph or digraph
• Diameters in graphs
• Extremal total distance of graphs of given radius I

This page was built for publication: Maximum size of digraphs of given radius