k-spectrally monomorphic tournaments
Abstract
A tournament is k-spectrally monomorphic if all the k× k principal submatrices of its adjacency matrix have the same characteristic polynomial. Transitive n-tournaments are trivially k-spectrally monomorphic. We show that there are no other for k∈ \3,…,n-3\ . Furthermore, we prove that for n≥ 5, a non-transitive n-tournament is (n-2)-spectrally monomorphic if and only if it is doubly regular. Finally, we give some results on (n-1)-spectrally monomorphic regular tournaments.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.