Spanning Eulerian Subdigraphs in Jump Digraphs  

作　　者：Juan LIU Hong YANG Hongjian LAI Xindong ZHANG 

机构地区：[1]College of Big Data Statistics,Guizhou University of Finance and Economics,Guizhou 550025,P.R.China [2]College of Mathematics and System Sciences,Xinjiang University,Xinjiang 830046,P.R.China [3]Department of Mathematics,West Virginia University,Morgantown 26506,USA [4]School of Mathematical Sciences,Xinjiang Normal University,Xinjiang 830017,P.R.China

出　　处：《Journal of Mathematical Research with Applications》2022年第5期441-454,共14页数学研究及应用（英文版）

基　　金：Supported by the National Natural Science Foundation of China(Grant Nos.11761071,11861068);Guizhou Key Laboratory of Big Data Statistical Analysis,China(Grant No.[2019]5103);the Natural Science Foundation of Xinjiang Uygur Autonomous Region(Grant No.2022D01E13)。

摘　　要：A jump digraph J(D)of a directed multigraph D has as its vertex set being A(D),the set of arcs of D;where(a,b)is an arc of J(D)if and only if there are vertices u1,v1,u2,v2in D such that a=(u1,v1),b=(u2,v2)and v1≠u2.In this paper,we give a well characterized directed multigraph families H1and H2,and prove that a jump digraph J(D)of a directed multigraph D is strongly connected if and only if D?H1.Specially,J(D)is weakly connected if and only if D?H2.The following results are obtained:(ⅰ)There exists a family D of wellcharacterized directed multigraphs such that strongly connected jump digraph J(D)of directed multigraph is strongly trail-connected if and only if D?D.(ⅱ)Every strongly connected jump digraph J(D)of directed multigraph D is weakly trail-connected,and so is supereulerian.(ⅲ)Every weakly connected jump digraph J(D)of directed multigraph D has a spanning trail.

关 键 词：supereulerian digraph line digraph jump digraph weakly trail-connected strongly trail-connected 

分 类 号：O157.5[理学—数学]