TITLE:
On a Class of Supereulerian Digraphs
AUTHORS:
Khalid A. Alsatami, Xindong Zhang, Juan Liu, Hong-Jian Lai
KEYWORDS:
Supereulerian, Digraph 2-Sums, Arc-Strong-Connectivity, Hamiltonian-Connected Digraphs
JOURNAL NAME:
Applied Mathematics,
Vol.7 No.3,
February
29,
2016
ABSTRACT: The 2-sum of two digraphs and , denoted , is the digraph obtained from the disjoint union of and by identifying an arc in with an arc in . A digraph D is supereulerian if D contains a spanning eulerian subdigraph. It has been noted that the 2-sum of two supereulerian (or even hamiltonian) digraphs may not be supereulerian. We obtain several sufficient conditions on and for to be supereulerian. In particular, we show that if and are symmetrically connected or partially symmetric, then is supereulerian.