English

$k$-spectrally monomorphic tournaments

Combinatorics 2021-12-13 v1

Abstract

A tournament is kk-spectrally monomorphic if all the k×kk\times k principal submatrices of its adjacency matrix have the same characteristic polynomial. Transitive nn-tournaments are trivially kk-spectrally monomorphic. We show that there are no other for k{3,,n3}k\in \{3,\ldots,n-3\} . Furthermore, we prove that for n5n\geq 5, a non-transitive nn-tournament is (n2)(n-2)-spectrally monomorphic if and only if it is doubly regular. Finally, we give some results on (n1)(n-1)-spectrally monomorphic regular tournaments.

Keywords

Cite

@article{arxiv.2112.05460,
  title  = {$k$-spectrally monomorphic tournaments},
  author = {Abderrahim Boussaïri and Imane Souktani and Imane Talbaoui and Mohamed Zouagui},
  journal= {arXiv preprint arXiv:2112.05460},
  year   = {2021}
}
R2 v1 2026-06-24T08:12:05.453Z