作者：Yoomi; RHO; Byeong; Moon; KIM; Woonjae...有向图直径拉面欧拉路径周期正则极值
摘要：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.
注：因版权方要求，不能公开全文，如需全文，请咨询杂志社
