Author(s)

Khalid A. Alsatami¹, Xindong Zhang², Juan Liu², Hong-Jian Lai³

¹Department of Mathematics, College of Science, Qassim University, Buraydah, KSA.
²College of Mathematics Sciences, Xinjiang Normal University, Urumqi, China.
³Department of Mathematics, West Virginia University, Morgantown, WV, USA.

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.

Supereulerian, Digraph 2-Sums, Arc-Strong-Connectivity, Hamiltonian-Connected Digraphs

Alsatami, K. , Zhang, X. , Liu, J. and Lai, H. (2016) On a Class of Supereulerian Digraphs. Applied Mathematics, 7, 320-326. doi: 10.4236/am.2016.73029.