The absolute values of the perfect matching derangement graph's eigenvalues almost follow the lexicographic order of partitions
DOI10.1016/J.DISC.2024.114188zbMATH Open1545.05146MaRDI QIDQ6589148FDOQ6589148
Authors: Meiqiao Zhang, F. M. Dong 
Publication date: 19 August 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Combinatorial aspects of partitions of integers (05A17) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Erdős-Ko-Rado theorems. Algebraic approaches
- On the spectrum of the perfect matching derangement graph
- On the spectrum of the derangement graph
- Solving the Ku-Wales conjecture on the eigenvalues of the derangement graph
- Eigenvalues of the derangement graph
- An algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings
- Erdős-Ko-Rado for perfect matchings
- Alternating sign property of the perfect matching derangement graph
This page was built for publication: The absolute values of the perfect matching derangement graph's eigenvalues almost follow the lexicographic order of partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589148)
