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

Yuan, LL; Meng, JX

Meng, JX (通讯作者),Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Peoples R China.

GRAPHS AND COMBINATORICS, 2023; 39 (2):

Abstract

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 antidi......

Full Text Link