A tournament is an orientation of a complete graph, and in general a multipartite or c-partite tournament is an orientation of a complete c-partite graph. If x is a vertex of a digraph D, then weâ€¦ (More)

The vertex set of a digraph D is denoted by V (D). A c-partite tournament is an orientation of a complete c-partite graph. A digraph D is called cycle complementary if there exist two vertex disjointâ€¦ (More)

If x is a vertex of a digraph D, denote by d+(x) and dâˆ’(x) the outdegree and the indegree of x, respectively. The global irregularity of a digraph D is defined by ig(D) = max{d+(x), dâˆ’(x)} âˆ’â€¦ (More)

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 defined by ig(D) = max{d+(x),â€¦ (More)

The vertex set of a digraph D is denoted by V (D). A c-partite tournament is an orientation of a complete c-partite graph. In 1999, Yeo conjectured that each regular c-partite tournament D with c â‰¥ 4â€¦ (More)