当前位置: X-MOL 学术Appl. Math. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Anti-Eulerian digraphs
Applied Mathematics and Computation ( IF 4 ) Pub Date : 2021-07-17 , DOI: 10.1016/j.amc.2021.126513
Bo Zhang 1 , Baoyindureng Wu 1
Affiliation  

Let D be a digraph. A closed anti-directed Euler trail of D is a closed trail in which consecutive arcs have opposite directions and each arc of D occurs exactly once. A digraph is anti-Eulerian if it contains a closed anti-directed Euler trail. A tournament T is anti-Eulerian if and only if both d+(v) and d(v) are even for any vV(T). The Cartesian product of two directed cycles Cn1Cn2 is anti-Eulerian if and only if gcd(n1,n2)=1. If n1,n2,,n2k can be partitioned into k relatively prime pairs, then Cn1Cn2Cn2k is anti-Eulerian. If each of Di (1ik) is an anti-Eulerian digraph and at least one of them is not a bipartite digraph, then D1D2Dk is anti-Eulerian.



中文翻译:

反欧拉有向图

D是一个有向图。一个封闭的反方向欧拉轨迹D 是一条封闭的轨迹,其中连续的弧具有相反的方向,每个弧的 D恰好发生一次。如果一个有向图包含一个封闭的反定向欧拉轨迹,那么它就是反欧拉轨迹。一场比赛 是反欧拉的当且仅当两者 d+(v)d-(v) 甚至对于任何 v(). 两个有向循环的笛卡尔积Cn1Cn2 是反欧拉当且仅当 GCd(n1,n2)=1. 如果n1,n2,,n2 可以分为 相对质数对,那么 Cn1Cn2Cn2是反欧拉的。如果每个D一世 (1一世) 是一个反欧拉有向图并且其中至少一个不是二部有向图,那么 D1D2D 是反欧拉的。

更新日期:2021-07-18
down
wechat
bug