- Tytuł:
- On the n-Partite Tournaments with Exactly n − m + 1 Cycles of Length m
- Autorzy:
-
Guo, Qiaoping
Meng, Wei - Powiązania:
- https://bibliotekanauki.pl/articles/32083764.pdf
- Data publikacji:
- 2021-02-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
multipartite tournaments
tournaments
cycles - Opis:
- Gutin and Rafiey [Multipartite tournaments with small number of cycles, Australas J. Combin. 34 (2006) 17–21] raised the following two problems: (1) Let m ∈ {3, 4, . . ., n}. Find a characterization of strong n-partite tournaments having exactly n − m + 1 cycles of length m; (2) Let 3 ≤ m ≤ n and n ≥ 4. Are there strong n-partite tournaments, which are not themselves tournaments, with exactly n − m + 1 cycles of length m for two values of m? In this paper, we discuss the strong n-partite tournaments D containing exactly n − m + 1 cycles of length m for 4 ≤ m ≤ n − 1. We describe the substructure of such D satisfying a given condition and we also show that, under this condition, the second problem has a negative answer.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2021, 41, 1; 75-82
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł