Minimum Orders of Eulerian Oriented Digraphs with Given Diameter

被引：2
作者：
Rho, Yoomi [1 ]
Kim, Byeong Moon [2 ]
Hwang, Woonjae [3 ]
Song, Byung Chul [2 ]
机构：
[1] Univ Incheon, Dept Math, Inchon 402749, South Korea
[2] Gangneung Wonju Natl Univ, Dept Math, Kangnung 210702, South Korea
[3] Korea Univ, Dept Math & Informat, Sejong 339700, South Korea
来源：
ACTA MATHEMATICA SINICA-ENGLISH SERIES | 2014年 / 30卷 / 07期
关键词：
Oriented digraph; eulerian digraph; minimum order; diameter; GRAPHS; CLASSIFICATION; ENUMERATION;
D O I：
10.1007/s10114-014-3194-4
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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.
引用
收藏
页码：1125 / 1132
页数：8
相关论文
共 12 条
12