Geodesic
On the structure of tournaments consisting of only kings
Prikladnaya Diskretnaya Matematika. Supplement, no. 17 (2024), pp. 154-156 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The structure of some classes of tournaments consisting of only kings and their number are considered, and it is also shown that such tournaments are not simple. A tournament is called regular if all its vertices have the same entry and exit degrees. The vertex $v$ of the tournament is king if the length of the path from $v$ to any other vertex is no more than 2. The following main result has been obtained: tournament $T$ of dimension $n$, where $n$ is odd, consisting of only kings, $k$ rows of the distance matrix of which have the form $(1^{(n-1)/2},2^{(n -1)/2})$, and the rest $(1^{(n-i-1)},2^i )$, where $i\in\{1,\ldots,(n-k)/2,(n+k)/2-1,\ldots,n-2\}$, has the following structure: at the base there is a regular tournament of dimension $k$, to which two vertices $v_1$ and $v_2$ are sequentially added as follows: arcs lead from vertex $v_1$ to all vertices of tournament $T^*$; from each vertex of $T^*$ there are arcs leading to vertex $v_2$; and there is also an arc from $v_2$ to $v_1$, where $T^*$ is the tournament obtained at the previous step, until the dimension of the resulting tournament is equal to $n$. Such a tournament is not simple, and for each $n$ there are as many such tournaments as there are regular tournaments with the number of vertices equal to that of the tournament at the base.
Keywords: graph theory, tournament
Mots-clés : distance matrix. 
@article{PDMA_2024_17_a39,
     author = {A. O. Shabarkova and M. B. Abrosimov},
     title = {On the structure of tournaments consisting of only kings},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {154--156},
     year = {2024},
     number = {17},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2024_17_a39/}
}
TY  - JOUR
AU  - A. O. Shabarkova
AU  - M. B. Abrosimov
TI  - On the structure of tournaments consisting of only kings
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2024
SP  - 154
EP  - 156
IS  - 17
UR  - http://geodesic.mathdoc.fr/item/PDMA_2024_17_a39/
LA  - ru
ID  - PDMA_2024_17_a39
ER  - 
%0 Journal Article
%A A. O. Shabarkova
%A M. B. Abrosimov
%T On the structure of tournaments consisting of only kings
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2024
%P 154-156
%N 17
%U http://geodesic.mathdoc.fr/item/PDMA_2024_17_a39/
%G ru
%F PDMA_2024_17_a39
A. O. Shabarkova; M. B. Abrosimov. On the structure of tournaments consisting of only kings. Prikladnaya Diskretnaya Matematika. Supplement, no. 17 (2024), pp. 154-156. http://geodesic.mathdoc.fr/item/PDMA_2024_17_a39/

[1] Bogomolov A. M., Salii V. N., Algebraicheskie osnovy teorii diskretnykh sistem, Fizmatlit, M., 1997 | MR

[2] Kireeva A. V., “Kongruentsii turnirov”, Studenty — uskoreniyu nauchnogo progressa, Sb. stud. nauch. rab., Izd-vo Sarat. un-ta, Saratov, 1990, 3–5

[3] Moon J. W., Topics on Tournaments, Holt, Rinehart and Winston, N.Y., 1968 | MR | Zbl

[4] Erdös P., Fried E., Hajnal A., and Milner E. C., “Some remarks on simple tournaments”, Algebra Universalis, 2:2 (1972), 238–245 | DOI | MR | Zbl

[5] Moon J. W., “Solution to problem 463”, Math. Mag., 1962, no. 35, 189

[6] Maurer S., “The king chicken theorems”, Math. Magazine, 53:2 (1980), 67–80 | DOI | MR

[7] Oumazouz Z., Karim D., “A new symmetric key cryptographic algorithm using Paley graphs and ASCII values”, E3S Web Conf., 297 (2021), 01046, 5 pp. | DOI