Complementary Cycles in Irregular Multipartite Tournaments
A tournament is a directed graph obtained by assigning a direction for each edge in an undirected complete graph. A digraph D is cycle complementary if there exist two vertex disjoint cycles C and C′ such that V(D)=V(C)∪V(C′). Let D be a locally almost regular c-partite tournament with c≥3 and |γ(D)...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2016-01-01
|
| Series: | Mathematical Problems in Engineering |
| Online Access: | http://dx.doi.org/10.1155/2016/5384190 |