Research ArticleOpen AccessGoogle Scholar indexed
On a Class of Supereulerian Digraphs
Department of Mathematics, College of Science, Qassim University, Buraydah, KSA
College of Mathematics Sciences, Xinjiang Normal University, Urumqi, China
College of Mathematics Sciences, Xinjiang Normal University, Urumqi, China
Department of Mathematics, West Virginia University, Morgantown, WV, USA
- 1 Department of Mathematics, College of Science, Qassim University, Buraydah, KSA
- 2 College of Mathematics Sciences, Xinjiang Normal University, Urumqi, China
- 3 College of Mathematics Sciences, Xinjiang Normal University, Urumqi, China
- 4 Department of Mathematics, West Virginia University, Morgantown, WV, USA
Applied Mathematics·Volume 07 (2016)·Pages 320–326·Published 24 February 2016·DOI10.4236/am.2016.73029
Copy link · social · email
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.
KeywordsSupereulerianDigraph 2-SumsArc-Strong-ConnectivityHamiltonian-Connected Digraphs
- Bondy, J.A. and Murty, U.S.R. (2008) Graph Theory. Springer, New York. http://dx.doi.org/10.1007/978-1-84628-970-5
- Bang-Jensen, J. and Gutin, G. (2009) Digraphs: Theory, Algorithms and Applications. 2nd Edition. Springer-Verlag, London. http://dx.doi.org/10.1007/978-1-84800-998-1
- Boesch, F.T., Suffel, C. and Tindell, R. (1977) The Spanning Subgraphs of Eulerian Graphs. Journal of Graph Theory, 1, 79-84. http://dx.doi.org/10.1002/jgt.3190010115
- Pulleyblank, W.R. (1979) A Note on Graphs Spanned by Eulerian Graphs. Journal of Graph Theory, 3, 309-310. http://dx.doi.org/10.1002/jgt.3190030316
- Catlin, P.A. (1992) Supereulerian Graphs: A Survey. Journal of Graph Theory, 16, 177-196. http://dx.doi.org/10.1002/jgt.3190160209
- Chen, Z.H. and Lai, H.-J. (1995) Reduction Techniques for Super-Eulerian graphs and Related Topics—A Survey. In: Gu, T.-H., Ed., Combinatorics and Graph Theory’95, Vol. 1 (Hefei), World Scientific Publishing, River Edge, 53-69.
- Lai, H.-J., Shao, Y. and Yan, H. (2013) An Update on Supereulerian Graphs. WSEAS Transactions on Mathematics, 12, 926-940.
- Algefari, M.J. and Lai, H.-J. (2016) Supereulerian Digraphs with Large Arc-Strong Connectivity. Journal of Graph Theory, 81, 393-402. http://dx.doi.org/10.1002/jgt.21885
- Bang-Jensen, J. and Maddaloni, A. (2015) Sufficient Conditions for a Digraph to Be Supereulerian. Journal of Graph Theory, 79, 8-20. http://dx.doi.org/10.1002/jgt.21810
- Gutin, G. (1993) Cycles and Paths in Directed Graphs. PhD Thesis, School of Mathematics, Tel Aviv University, Tel Aviv-Yafo.
- Gutin, G. (2000) Connected (g; f)-Factors and Supereulerian Digraphs. Ars Combinatoria, 54, 311-317.
- Hong, Y.M., Lai, H.-J. and Liu, Q.H. (2014) Supereulerian Digraphs. Discrete Mathematics, 330, 87-95. http://dx.doi.org/10.1016/j.disc.2014.04.018
- Lewin, M. (1975) On Maximal Circuits in Directed Graphs. Journal of Combinatorial Theory, Series B, 18, 175-179. http://dx.doi.org/10.1016/0095-8956(75)90045-3
- Algefari, M.J., Alsatami, K.A., Lai, H.-J. and Liu, J. (2016) Supereulerian Digraphs with Given Local Structures. Information Processing Letters, 116, 321-326. http://dx.doi.org/10.1016/j.ipl.2015.12.008
- Alsatami, K.A. (2016) A Study on Dicycles and Eulerian Subdigraphs in Digraphs. PhD Dissertation, West Virginia University, Morgantown.