相关论文: Structure of singular and nonsingular tournament m…
A tournament is an orientation of a graph. Each edge represents a match, directed towards the winner. The score sequence lists the number of wins by each team. Landau (1953) characterized score sequences of the complete graph. Moon (1963)…
Matrix theory, foundational in diverse fields such as mathematics, physics, and computational sciences, typically categorizes matrices based strictly on their invertibility-determined by a sharply defined singular or nonsingular…
We study the effects of randomness on competitions based on an elementary random process in which there is a finite probability that a weaker team upsets a stronger team. We apply this model to sports leagues and sports tournaments, and…
Game theory provides a mathematical framework for analysing strategic situations involving at least two players. Normal-form games model situations where the players simultaneously pick their moves. In this thesis we explore the strategic…
In this paper, we completely characterize the $m$-step competition graph of a bipartite tournament for any integer $m \ge 2$. In addition, we compute the competition index and the competition period of a bipartite tournament.
In this paper, we completely characterize the niche graphs of bipartite tournaments and find their interesting properties.
The M-matrix is an important concept in matrix theory, and has many applications. Recently, this concept has been extended to higher order tensors [18]. In this paper, we establish some important properties of M-tensors and nonsingular…
The clique number of a tournament is the maximum clique number of a graph formed by keeping backwards arcs in an ordering of its vertices. We study the time complexity of computing the clique number of a tournament and prove that, for any…
Simple drawings are drawings of graphs in which any two edges intersect at most once (either at a common endpoint or a proper crossing), and no edge intersects itself. We analyze several characteristics of simple drawings of complete…
Complete digraphs are referred to in the combinatorics literature as tournaments. We consider a family of semi-simplicial complexes, that we refer to as "tournaplexes", whose simplices are tournaments. In particular, given a digraph…
Given a tournament T=(V,A), a subset X of $V$ is an interval of T provided that for every a, b in X and x\in V-X, (a,x) in A if and only if (b,x) in A. For example, $\emptyset$, {x}(x in V) and V are intervals of T, called trivial…
The support of a matrix M is the (0,1)-matrix with ij-th entry equal to 1 if the ij-th entry of M is non-zero, and equal to 0, otherwise. The digraph whose adjacency matrix is the support of M is said to be the digraph of M. This paper…
A tournament is called locally transitive if the outneighbourhood and the inneighbourhood of every vertex are transitive. Equivalently, a tournament is locally transitive if it avoids the tournaments $W_4$ and $L_4$, which are the only…
For two integers $n\geq 3$ and $2\leq p\leq n$, we denote $D(n,p)$ the digraph obtained from a directed $n$-cycle by changing the orientations of $p-1$ consecutive arcs. In this paper, we show that a family of $k$-regular $(k\geq 3)$…
A vertex subset $W\subseteq V$ of the graph $G = (V,E)$ is an independent dominating set if every vertex in $V\setminus W$ is adjacent to at least one vertex in $W$ and the vertices of $W$ are pairwise non-adjacent. We enumerate independent…
The problem of determining whether a diagonally dominant matrix is singular or nonsingular is a classical topic in matrix theory. This paper develops necessary and sufficient conditions for the singularity or nonsingularity of diagonally…
We study deterministic constructions of graphs for which the unique completion of low rank matrices is generically possible regardless of the values of the entries. We relate the completability to the presence of some patterns (particular…
Ranking athletes by their performance in competitions and tournaments is common in every popular sport and has significant benefits that contribute to both the organization and strategic aspects of competitions. Although rankings are…
A tournament H is quasirandom-forcing if the following holds for every sequence (G_n) of tournaments of growing orders: if the density of H in G_n converges to the expected density of H in a random tournament, then (G_n) is quasirandom.…
A random walk-like model is considered to discuss statistical aspects of tournaments. The model is applied to soccer leagues with emphasis on the scores. This competitive system was computationally simulated and the results are compared…