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 others 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
