AbstractPlensik (1984) has given a sharp upper bound for the sum of the distance between all ordered pairs of nodes in a strong tournament Tn. We strengthen this result by deriving a bound that involves an additional parameter
AbstractA digraph without loops, multiple arcs and directed cycles of length two is called a local t...
We prove that every $n$-vertex tournament has at most $n\left(\frac{n-1}{2}\right)^k$ walks of lengt...
AbstractChen et al. [Partitioning vertices of a tournament into independent cycles, J. Combin. Theor...
AbstractPlensik (1984) has given a sharp upper bound for the sum of the distance between all ordered...
AbstractLet k be a positive integer. A strong digraph G is termed k-connected if the removal of any ...
AbstractAn n-tournament is an orientation of a complete n-partite graph. It was proved by J.A. Bondy...
AbstractA tournament is an orientation of a complete graph and a multipartite tournament is an orien...
AbstractA digraph without loops, multiple arcs and directed cycles of length two is called a local t...
We provide upper bounds for the determining number and the metric dimension of tournaments. A set of...
In 1976, Alspach, Mason, and Pullman conjectured that any tournament $T$ of even order can be decomp...
We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from ...
Paired comparison is the process of comparing objects two at a time. A tournament in Graph Theory is...
AbstractA digraph T is strong if for every pair of vertices u and v there exists a directed path fro...
AbstractLet T(R) denote the set of all tournaments with score vector R = (r1, r2,…, rn). R. A. Brual...
AbstractIn this paper, by using minimum out-degree and minimum in-degree, we give a new lower bound ...
AbstractA digraph without loops, multiple arcs and directed cycles of length two is called a local t...
We prove that every $n$-vertex tournament has at most $n\left(\frac{n-1}{2}\right)^k$ walks of lengt...
AbstractChen et al. [Partitioning vertices of a tournament into independent cycles, J. Combin. Theor...
AbstractPlensik (1984) has given a sharp upper bound for the sum of the distance between all ordered...
AbstractLet k be a positive integer. A strong digraph G is termed k-connected if the removal of any ...
AbstractAn n-tournament is an orientation of a complete n-partite graph. It was proved by J.A. Bondy...
AbstractA tournament is an orientation of a complete graph and a multipartite tournament is an orien...
AbstractA digraph without loops, multiple arcs and directed cycles of length two is called a local t...
We provide upper bounds for the determining number and the metric dimension of tournaments. A set of...
In 1976, Alspach, Mason, and Pullman conjectured that any tournament $T$ of even order can be decomp...
We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from ...
Paired comparison is the process of comparing objects two at a time. A tournament in Graph Theory is...
AbstractA digraph T is strong if for every pair of vertices u and v there exists a directed path fro...
AbstractLet T(R) denote the set of all tournaments with score vector R = (r1, r2,…, rn). R. A. Brual...
AbstractIn this paper, by using minimum out-degree and minimum in-degree, we give a new lower bound ...
AbstractA digraph without loops, multiple arcs and directed cycles of length two is called a local t...
We prove that every $n$-vertex tournament has at most $n\left(\frac{n-1}{2}\right)^k$ walks of lengt...
AbstractChen et al. [Partitioning vertices of a tournament into independent cycles, J. Combin. Theor...
DOI
Add to ORKG