## Abstract A tournament is an oriented complete graph, and one containing no directed cycles is called __transitive__. A tournament __T__=(__V, A__) is called __m__β__partition transitive__ if there is a partition such that the subtournaments induced by each __X__~__i__~ are all transitive, an
The radii of n-partite tournaments
β Scribed by G. M. Gutin
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 1986
- Tongue
- English
- Weight
- 151 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0001-4346
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Let k be a positive integer. A strong digraph G is termed k-connected if the removal of any set of fewer than k vertices results in a strongly connected digraph. The purpose of this paper is to show that every k-connected tournament with at least 8k vertices contains k vertex-disjoint directed cycle
By virtue of the n-partite entangled state, we extend the way of Agarwal-SimonΓs presenting single-mode squeezed state to n-mode case and find a new representation of the n-mode squeezed state. This n-mode squeezed state is also an entangled state and can be a superposition of n-mode coherent states
Gary Karkofsky a.k.a Merciless the Supervillain without MercyTM is presently the most disliked supervillain in the world. Superheroes don't want to just throw him in jail, they want to deliver an epic beat down for ending their golden age by killing Merciful the Superhero with MercyTM. His fellow su