Distance and size in digraphs

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)

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 languageEnglish
Pages (from-to)144-148
Number of pages5
JournalDiscrete Mathematics
Volume338
DOIs
Publication statusPublished - 6 Jan 2015

Keywords

  • Diameter
  • Digraph
  • Eulerian digraph
  • Out-radius
  • Radius

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'Distance and size in digraphs'. Together they form a unique fingerprint.

Cite this