Ore conditions for antistrong digraphs

Lili Yuan and Jixiang Meng

Applied Mathematics and Computation, 2023, vol. 457, issue C

Abstract: In a digraph, an antidirected trail is a special trail satisfying that the arcs in the trail alternate between backward and forward arcs. For an antidirected trail, if it begins and ends with a forward arc, then it is a forward antidirected trail. A digraph D is said to be antistrong if there exist a forward antidirected (x,y)-trail for any x,y∈V(D). Suppose D is a non-bipartite digraph with |V(D)|≥3. Denote σ2(D)=min{d−(x)+d−(y),d+(x)+d+(y)|x,y∈V(D),xy∉A(D)}. This paper shows that D is antistrong if σ2(D)≥n for odd n or δ(D)≥2 and σ2(D)≥n−1 for even n. Furthermore, we give examples to demonstrate that all the results are best possible.

Keywords: Antistrong; Ore condition; Dirac condition; Bipartite digraph (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300323003508
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:457:y:2023:i:c:s0096300323003508

DOI: 10.1016/j.amc.2023.128181

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().