Abstract
We determine the maximum number of arcs in an Eulerian digraph of given order and diameter. Our bound generalises a classical result on the maximum number of edges of an undirected graph of given order and diameter by Ore (1968) and Homenko and OstroverhiѤ (1970). We further determine the maximum size of a bipartite digraph of given order and radius.
Original language | English |
---|---|
Pages (from-to) | 144-148 |
Number of pages | 5 |
Journal | Discrete Mathematics |
Volume | 338 |
DOIs | |
Publication status | Published - 6 Jan 2015 |
Keywords
- Diameter
- Digraph
- Eulerian digraph
- Out-radius
- Radius
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics