Abstract

In this paper we relate the global irregularity and the order of a c-partite tournament T to the existence of certain cycles and the problem of finding the maximum strongly connected subtournament of T. In particular, we give results related to the following problem of Volkmann: How close to regular must a c-partite tournament be, to secure a strongly connected subtournament of order c?

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call