The following pages link to Distance and size in digraphs (Q468452):
Displaying 11 items.
- Maximum size of digraphs with some parameters (Q326498) (← links)
- Minimum orders of Eulerian oriented digraphs with given diameter (Q477806) (← links)
- The diameter of almost Eulerian digraphs (Q612941) (← links)
- Diameter and maximum degree in Eulerian digraphs (Q906483) (← links)
- On the girth of digraphs (Q1969785) (← links)
- On average distance in tournaments and Eulerian digraphs (Q2026317) (← links)
- Size of graphs and digraphs with given diameter and connectivity constraints (Q2043684) (← links)
- The eccentricity matrix of a digraph (Q2081466) (← links)
- The largest graphs with given order and diameter: a simple proof (Q2287761) (← links)
- Maximum size of digraphs of given radius (Q6041555) (← links)
- Bounds on the fault-diameter of graphs (Q6496348) (← links)