UP - logo
E-resources
Full text
Peer reviewed
  • Minimum Orders of Eulerian ...
    Rho, Yoomi; Kim, Byeong Moon; Hwang, Woonjae; Song, Byung Chul

    Acta mathematica Sinica. English series, 07/2014, Volume: 30, Issue: 7
    Journal Article

    A digraph D is oriented if it does not contain 2-cycles. If an oriented digraph D has a directed eulerian path, it is an oriented eulerian digraph. In this paper, when an oriented eulerian digraph D has minimum out-degree 2 and a diameter d, we find the minimum order of D. In addition, when D is 2-regular with diameter 4rn (m≥2), we classify the extremal cases.