상세 보기
Minimum Orders of Eulerian Oriented Digraphs with Given Diameter
- Rho, Yoomi;
- Kim, Byeong Moon;
- Hwang, Woonjae;
- Song, Byung Chul
Citations
WEB OF SCIENCE
2Citations
SCOPUS
2초록
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.
키워드
Oriented digraph; eulerian digraph; minimum order; diameter; GRAPHS; CLASSIFICATION; ENUMERATION
- 제목
- Minimum Orders of Eulerian Oriented Digraphs with Given Diameter
- 저자
- Rho, Yoomi; Kim, Byeong Moon; Hwang, Woonjae; Song, Byung Chul
- 발행일
- 2014-07
- 유형
- Article
- 권
- 30
- 호
- 7
- 페이지
- 1125 ~ 1132