Abstract
In 2013, Ku and Wong showed that for any partitions μ and μ′ of a positive integer n with the same first part u and the lexicographic order μ◃μ′, the eigenvalues ξμ and ξμ′ of the derangement graph Γn have the property |ξμ|≤|ξμ′|, where the equality holds if and only if u=3 and all other parts are less than 3. In this article, we obtain an analogous conclusion on the eigenvalues of the perfect matching derangement graph M2n of K2n by finding a new recurrence formula for the eigenvalues of M2n.
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.
