典型文献
Spanning Eulerian Subdigraphs in Jump Digraphs
文献摘要：
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,v2 in D such that a=(u1,v1),b=(u2,v2)and v1 ≠ u2.In this paper,we give a well characterized directed multigraph families H1 and 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 well-characterized 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.
文献关键词：
中图分类号：
作者姓名：
Juan LIU;Hong YANG;Hongjian LAI;Xindong ZHANG
作者机构：
College of Big Data Statistics,Guizhou University of Finance and Economics,Guizhou 550025,P.R.China;College of Mathematics and System Sciences,Xinjiang University,Xinjiang 830046,P.R.China;Department of Mathematics,West Virginia University,Morgantown 26506,USA;School of Mathematical Sciences,Xinjiang Normal University,Xinjiang 830017,P.R.China
文献出处：
引用格式：
[1]Juan LIU;Hong YANG;Hongjian LAI;Xindong ZHANG-.Spanning Eulerian Subdigraphs in Jump Digraphs)[J].数学研究及应用,2022(05):441-454
A类：
Subdigraphs,multigraph,multigraphs,supereulerian
B类：
Spanning,Eulerian,Jump,Digraphs,jump,directed,has,its,vertex,set,being,arcs,where,if,only,there,are,vertices,u1,v1,u2,v2,such,that,In,this,paper,give,well,characterized,families,H1,H2,prove,strongly,connected,Specially,weakly,following,results,obtained,There,exists,family,trail,Every,so,spanning
AB值：
0.353948
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
