A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Cycles through a given arc and certain partite sets in almost regular multipartite tournaments
2004
Discrete Mathematics
If x is a vertex of a digraph D, then we denote by d + (x) and d − (x) the outdegree and the indegree of x, respectively. The global irregularity of a digraph D is deÿned by ig(D) = max{d + (x); d − (x)} − min{d + (y); d − (y)} over all vertices x and y of D (including x = y). If ig(D) = 0, then D is regular and if ig(D) 6 1, then D is almost regular. A c-partite tournament is an orientation of a complete c-partite graph. In 1998, Guo and Kwak showed that, if D is a regular c-partite tournament
doi:10.1016/s0012-365x(04)00158-x
fatcat:5g4o2it55vfjtgdz65dlo3amde