paper

Sufficient conditions for closed-trailable in digraphs

arXiv:2406.14332

Abstract

A digraph with a subset of is called {\bf -strong} if for every pair of distinct vertices and of , there is a -dipath and a -dipath in . We define a digraph with a subset of to be {\bf -strictly strong} if there exist two nonadjacent vertices such that contains a closed ditrail through the vertices and ; and define a subset to be {\bf closed-trailable} if contains a closed ditrail through all the vertices of . In this paper, we prove that for a digraph with vertices and a subset of , if is -strong and if for any two nonadjacent vertices of , then is closed-trailable. This result generalizes the theorem of Bang-Jensen et al. \cite{BaMa14} on supereulerianity. Moveover, we show that for a digraph and a subset of , if is -strictly strong and if , where is the minimum semi-degree of and is the matching number of , then is closed-trailable. This result generalizes the theorem of Algefari et al. \cite{AlLa15} on supereulerianity.

13 pages

Sufficient conditions for closed-trailable in digraphs · wovepaper