Back to Search
Start Over
Sufficient Ore type condition for a digraph to be supereulerian.
- Source :
-
Applied Mathematics & Computation . Dec2021, Vol. 410, pN.PAG-N.PAG. 1p. - Publication Year :
- 2021
-
Abstract
- • An Ore type condition for a strong digraph to be supereulerian is obtained. • A previous result given by Bang-Jensen in 2015 is extended. • A conjecture for a 2-strong digraph to be supereulerian is proposed. A digraph D is called supereulerian if D has a spanning eulerian subdigraph. In this article, we show that a strong digraph D with n vertices is supereulerian if for every three different vertices z , w and v such that z and w are nonadjacent, d (z) + d (w) + d + (z) + d − (v) ≥ 3 n − 5 (if (z , v) ∉ A (D)) and d (z) + d (w) + d − (z) + d + (v) ≥ 3 n − 5 (if (v , z) ∉ A (D)). And this bound is sharp. [ABSTRACT FROM AUTHOR]
- Subjects :
- *LOGICAL prediction
Subjects
Details
- Language :
- English
- ISSN :
- 00963003
- Volume :
- 410
- Database :
- Academic Search Index
- Journal :
- Applied Mathematics & Computation
- Publication Type :
- Academic Journal
- Accession number :
- 151718600
- Full Text :
- https://doi.org/10.1016/j.amc.2021.126470