We obtain lower and upper bounds for the maximum weight of a directed cu...
A quasi-kernel of a digraph D is an independent set Q⊆ V(D)
such that fo...
Let D be a digraph and let λ(D) denote the number of vertices in a
longe...
In his paper "Kings in Bipartite Hypertournaments" (Graphs & Combinatori...
Let D be a strongly connected digraph. The average distance
σ̅(v) of a v...
Consider a complete graph K_n with edge weights drawn independently from...