Related papers: On $m$-step competition graphs of bipartite tourna…
In this paper, we study $(1,2)$-step competition graphs of bipartite tournaments. A bipartite tournament means an orientation of a complete bipartite graph. We show that the $(1,2)$-step competition graph of a bipartite tournament has at…
A multipartite tournament is an orientation of a complete $k$-partite graph for some positive integer $k\geq 3$. We say that a multipartite tournament $D$ is tight if every partite set forms a clique in the $(1,2)$-step competition graph,…
In this paper, we completely characterize the niche graphs of bipartite tournaments and find their interesting properties.
A multipartite tournament is an orientation of a complete $k$-partite graph for some positive integer $k\geq 3$. We say that a multipartite tournament $D$ is tight if every partite set forms a clique in the $(1,2)$-step competition graph,…
We say that a digraph $D$ is $(i,j)$-step competitive if any two vertices have an $(i,j)$-step common out-neighbor in $D$ and that a graph $G$ is $(i,j)$-step competitively orientable if there exists an $(i,j)$-step competitive orientation…
In this paper, we discover all the triangle-free graphs that are competition graphs of multipartite tournaments.
In this paper, we compute competition indices and periods of multipartite tournaments. We first show that the competition period of an acyclic digraph $D$ is one and $\zeta(D) +1$ is a sharp upper bound of the competition index of $D$ where…
Competition graphs were created in connected to a biological model as a means of reflecting the competition relations among the predators in the food webs and determining the smallest dimension of ecological phase space. In 2011, Factor and…
In this article, we introduce the notion of the double competition multigraph of a digraph. We give characterizations of the double competition multigraphs of arbitrary digraphs, loopless digraphs, reflexive digraphs, and acyclic digraphs…
Ranking the participants of a tournament has applications in voting, paired comparisons analysis, sports and other domains. In this paper we introduce bipartite tournaments, which model situations in which two different kinds of entity…
We say that a digraph $D$ is competitive if any pair of vertices has a common out-neighbor in $D$ and that a graph $G$ is competitively orientable if there exists a competitive orientation of $G$. The notion of competitive digraphs arose…
Given a positive integer $m$, the $m$-step competition graph of a digraph $D$, denoted by $C^m(D)$, has the same vertex set as $D$ and has an edge between vertices $u$ and $v$ if and only if there exists a vertex $w$ such that there exist…
A regular bipartite tournament is an orientation of a complete balanced bipartite graph $K_{2n,2n}$ where every vertex has its in- and outdegree both equal to $n$. In 1981, Jackson conjectured that any regular bipartite tournament can be…
A multipartite tournament is an orientation of a complete $c$-partite graph. In [L. Volkmann, A remark on cycles through an arc in strongly connected multipartite tournaments, Appl. Math. Lett. 20 (2007) 1148--1150], Volkmann proved that a…
We investigate some properties of multipartite entanglement of hypergraph states in purely hypergraph theoretical terms. We first introduce an approach for computing the concurrence between two specific qubits of a hypergraph state by using…
The existence of an on-line competitive algorithm for coloring bipartite graphs remains a tantalizing open problem. So far there are only partial positive results for bipartite graphs with certain small forbidden graphs as induced…
A classification is given of all the countable homogeneous ordered bipartite graphs.
In this paper, we show that every $2m$-partition-connected graph $G$ has a bipartite $m$-partition-connected factor $H$ such that for each vertex $v$, $d_H(v)\le \lceil \frac{3}{4}d_G(v)\rceil$. A graph $H$ is said to be…
We form a "map of tournaments" by adapting the map framework from the world of elections. By a tournament we mean a complete directed graph where the nodes are the players and an edge points from a winner of a game to the loser (with no…
The paper consider an equivalence relation in the set of vertices of a bipartite graph. Some numerical characteristics showing the cardinality of equivalence classes are introduced. A combinatorial identity that is in relationship to these…