The global irregularity of a digraph D is defined by ig(D)=max{d+(x),d-(x)}-min{d+(y),d-(y)}over all vertices x and y of D(including x=y).With futher calculation,we improve an important lemma of Anders Yeo 《Path and cycles containing given arcs,in close t%一个有向图D的全局非正则度用ig(D)=max{d+(x),d-(x)}-min{d+(y),d-(y)}(包括x=y)来表示.这里x,y表示D中任意的顶点.文章经过进一步计算,对Yeo的一篇文章《Path and cycles containing given arcs,in close to regular multipartite tournaments》中的一个重要引理的结果进行了改进,即有向图D的顶点个数n,ig(D),和Vmax(D)满足一定条件后,13ig(D)+108k-198+11Vma
展开▼