Skip to content

Opening book details…

Can I read Necessary and Sufficient Conditions for Circulant Digraphs to be Antistrong, Weakly-Antistrong and Anti-Eulerian on EtoBox?

Necessary and Sufficient Conditions for Circulant Digraphs to be Antistrong, Weakly-Antistrong and Anti-Eulerian by Lili Yuan; Jixiang Meng is a Computer Science article available to read on EtoBox.

What is Necessary and Sufficient Conditions for Circulant Digraphs to be Antistrong, Weakly-Antistrong and Anti-Eulerian about?

An antidirected trail in a digraph is a trail (a walk with no arc repeated) in which the consecutive arcs have opposite directions. The forward antidirected trails are special antidirected trails which begin and end with forward arcs. A digraph D containing a forward antidirected (x, y)-trail for every choice of x, y ∈ V (D) is called antistrong. An antidirected trail which begins with a forward arc and ends with a backward arc is a forward-backward antidirected trail. For any x, y ∈ V (D), if digraph D has a forward antidirected (x, y)-trail or a forward-backward antidirected (x, y)-trail, then D is weakly-antistrong. A digraph is anti-Eulerian if it admits a closed antidirected Euler trail. Let BC(Z n , C) be a Bi-Circulant graph with n ≥ 3 and C = { j 1 , j 2 , . . . , j l }, l ≥ 2. This paper shows that the number of connected components of BC(Z n , C) is equal to gcd( j 1j l , . . . , j l-1j l , n). Based on the result, necessary and sufficient conditions are given to decide whether a circulant digraph is antistrong, weakly-antistrong or anti-Eulerian.

Who reads Necessary and Sufficient Conditions for Circulant Digraphs to be Antistrong, Weakly-Antistrong and Anti-Eulerian?

It is typically read by researchers, students, and practitioners in Computer Science.

Author
Lili Yuan; Jixiang Meng
Publisher
Springer Science and Business Media LLC
Published
2023
Language
EN
Field
Computer Science (Physical Sciences)

More by Lili Yuan; Jixiang Meng

Browse all works by Lili Yuan; Jixiang Meng