Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Minimum Orders of Eulerian Oriented Digraphs with Given Diameter
- Issue Date
- 7월-2014
- Publisher
- SPRINGER HEIDELBERG
- Keywords
- Oriented digraph; eulerian digraph; minimum order; diameter
- Citation
- ACTA MATHEMATICA SINICA-ENGLISH SERIES, v.30, no.7, pp.1125 - 1132
- Indexed
- SCIE
SCOPUS
- Journal Title
- ACTA MATHEMATICA SINICA-ENGLISH SERIES
- Volume
- 30
- Number
- 7
- Start Page
- 1125
- End Page
- 1132
- ISSN
- 1439-8516
- Abstract
- 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 4m (m >= 2), we classify the extremal cases.
- Files in This Item
- There are no files associated with this item.
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Related Researcher
- Hwang, Woon Jae
- 과학기술대학 (응용수리과학부 데이터계산과학전공)