• Kyungpook Mathematical Journal
• /
• v.48 no.2
• /
• pp.287-302
• /
• 2008

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 cycles $C_1$ and $C_2$ such that V(D) = $V(C_1)\;{\cup}\;V(C_2)$, and a multipartite tournament D is called weakly cycle complementary if there exist two vertex disjoint cycles $C_1$ and $C_2$ such that $V(C_1)\;{\cup}\;V(C_2)$ contains vertices of all partite sets of D. The problem of complementary cycles in 2-connected tournaments was completely solved by Reid [4] in 1985 and Z. Song [5] in 1993. They proved that every 2-connected tournament T on at least 8 vertices has complementary cycles of length t and ${\mid}V(T)\mid$ - t for all $3\;{\leq}\;t\;{\leq}\;{\mid}V(T)\mid/2$. Recently, Volkmann [8] proved that each regular multipartite tournament D of order ${\mid}V(D)\mid\;\geq\;8$ is cycle complementary. In this article, we analyze multipartite tournaments that are weakly cycle complementary. Especially, we will characterize all 3-connected c-partite tournaments with $c\;\geq\;3$ that are weakly cycle complementary.

• Journal of the Korean Mathematical Society
• /
• v.36 no.2
• /
• pp.431-445
• /
• 1999

A digraph T is called a local tournament if for every vertex x of T, the set of in-neighbors as well as the set of out-neighbors of in-neighbors of x induce tournaments. Let x and y be two vertices of a 3-connected and arc-3-cyclic local tournament T with y x. We investigate the structure of T such that T contains no (x,y)-path of length k for some k with 3 k V(T) -1. Our result generalized those of [2] and [5] for tournaments.

• Journal of the Korean Mathematical Society
• /
• v.44 no.3
• /
• pp.683-695
• /
• 2007

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. In a recent article, the authors proved that a regular c-partite tournament with $r{\geq}2$ vertices in each partite set contains a cycle with exactly r-1 vertices from each partite set, with exception of the case that c=4 and r=2. Here we will examine the existence of cycles with r-2 vertices from each partite set in regular multipartite tournaments where the r-2 vertices are chosen arbitrarily. Let D be a regular c-partite tournament and let $X{\subseteq}V(D)$ be an arbitrary set with exactly 2 vertices of each partite set. For all $c{\geq}4$ we will determine the minimal value g(c) such that D-X is Hamiltonian for every regular multipartite tournament with $r{\geq}g(c)$.

• Bulletin of the Korean Mathematical Society
• /
• v.36 no.2
• /
• pp.389-394
• /
• 1999

A v-path of an arc xy in a multipartite tournament T is an oriented oath in T-y which starts at x such that y does not dominate and end vertex of the path. We show that if T is a regular n-partite (n$\geq$7) tournament, then every arc of T has a v-path of length m for all m satisfying 2$\leq$m$\leq$n-2. Our result extends the corresponding result for regular tournaments, due to Alspach, Reid and Roselle [2] in 1974, to regular multipartite tournaments.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.31 no.3
• /
• pp.91-106
• /
• 2003

The objective of this study is to present management methods for Korean golf courses to achieve fast green that satisfies international golf tournament standards during an official golf tournament. The results of both the research and the comparative study on putting green management of 24 tournaments hosted in Korea and 12 tournaments hosted in overseas countries in 2002 are as follows: 1. As for the putting greens in Korean and foreign golf courses where official golf tournaments were held, Korean of official golf tournaments were mainly opened in two-green system golf courses contrary to the foreign cases, and the average size of the greens in Korean golf courses was shown to be greater than that of foreign golf courses to some extent, although there was no difference between the types of turf varieties. 2. Results have shown that unlike foreign golf courses, Korean golf courses were managing putting greens by using greens mowers mostly for general (non-tournament) management, and elaborate rolling attempts failed during official tournament flay week because of an insufficient number of rollers to be input. Therefore, Korean golf courses are required to make efforts to secure 21-inch working-behind greens mowers equipped with tournament bedknifes and 11 blades, which is the greens mowing equipment for professional tournaments, and rollers above all things in order to achieve fast green during tournament play week 3. In attempting to achieve green as fast as that of foreign golf courses, Korean golf courses need to consider the method of performing mowing at 3.0mm height or less with greens mowers for professional tournaments. This needs to be done more than two times, followed by a continuous practice of rolling for proper management.

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.6
• /
• pp.1649-1654
• /
• 2014

A tournament T is an orientation of a complete graph and an arc in T is called pancyclic if it is contained in a cycle of length l for all $3{\leq}l{\leq}n$, where n is the cardinality of the vertex set of T. In 1994, Moon [5] introduced the graph parameter h(T) as the maximum number of pancyclic arcs contained in the same Hamiltonian cycle of T and showed that $h(T){\geq}3$ for all strong tournaments with $n{\geq}3$. Havet [4] later conjectured that $h(T){\geq}2k+1$ for all k-strong tournaments and proved the case k = 2. In 2005, Yeo [7] gave the lower bound $h(T){\geq}\frac{k+5}{2}$ for all k-strong tournaments T. In this note, we will improve his bound to $h(T){\geq}\frac{2k+7}{3}$.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.237-245
• /
• 2006

The set S of distinct scores (outdegrees) of the vertices of a k-partite tournament T($X_l,\;X_2, ..., X_k$) is called its score set. In this paper, we prove that every set of n non-negative integers, except {0} and {0, 1}, is a score set of some 3-partite tournament. We also prove that every set of n non-negative integers is a score set of some k-partite tournament for every $n{\ge}k{\ge}2$.

• Journal of the Korean Mathematical Society
• /
• v.48 no.3
• /
• pp.599-626
• /
• 2011

Let T = (V,A) be a tournament. With every subset X of V is associated the subtournament T[X] = (X, A ${\cap}$ (X${\times}$X)) of T, induced by X. The dual of T, denoted by $T^*$, is the tournament obtained from T by reversing all its arcs. Given a tournament T' = (V,A') and a non-negative integer ${\kappa}$, T and T' are {$-{\kappa}$}-hemimorphic provided that for all X ${\subset}$ V, with ${\mid}X{\mid}$ = ${\kappa}$, T[V-X] and T'[V-X] or $T^*$[V-X] and T'[V-X] are isomorphic. The tournaments T and T' are said to be hereditarily hemimorphic if for all subset X of V, the subtournaments T[X] and T'[X] are hemimorphic. The purpose of this paper is to establish the hereditary hemimorphy of the {$-{\kappa}$}-hemimorphic tournaments on at least k + 7 vertices, for every ${\kappa}{\geq}5$.

• Bulletin of the Korean Mathematical Society
• /
• v.45 no.2
• /
• pp.385-396
• /
• 2008

For a positive integer m and a digraph D, the m-step competition graph $C^m$ (D) of D has he same set of vertices as D and an edge between vertices u and v if and only if there is a vertex x in D such that there are directed walks of length m from u to x and from v to x. Cho and Kim [6] introduced notions of competition index and competition period of D for a strongly connected digraph D. In this paper, we extend these notions to a general digraph D. In addition, we study competition indices of tournaments.

• Bulletin of the Korean Mathematical Society
• /
• v.38 no.1
• /
• pp.183-190
• /
• 2001

In this paper, we look at the spectral bounds of a bipartite tournament matrix M with arbitrary team size. Also we find the condition for the variance of the Perron vector of M to vanish.