| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4647338 | Discrete Mathematics | 2015 | 5 Pages |
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 Ostroverhii˘ (1970). We further determine the maximum size of a bipartite digraph of given order and radius.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Peter Dankelmann,