On the partition associated to the smallest eigenvalues of the \(k\)-point fixing graph

DOI10.1016/j.ejc.2017.03.004zbMath1365.05178OpenAlexW2603304008MaRDI QIDQ2357222

Cheng Yeaw Ku, Terry Shue Chien Lau, Kok Bin Wong

Publication date: 19 June 2017

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2017.03.004

zbMATH Keywords

smallest eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations ⋮ Eigenvalues of the matching derangement graph ⋮ Eigenvalues of Cayley graphs ⋮ The spectrum of eigenvalues for certain subgraphs of the \(k\)-point fixing graph ⋮ Alternating sign property of the perfect matching derangement graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cyclic decomposition of \(k\)-permutations and eigenvalues of the arrangement graphs
• Spectrum of Cayley graphs on the symmetric group generated by transpositions
• Largest independent sets of certain regular subgraphs of the derangement graph
• The smallest eigenvalues of the 1-point fixing graph
• Eigenvalues of the derangement graph
• On the spectrum of the derangement graph
• Feasibility conditions for the existence of walk-regular graphs
• Arrangement graphs: A class of generalized star graphs
• Spectra of Cayley graphs
• Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
• The spectrum of eigenvalues for certain subgraphs of the \(k\)-point fixing graph
• Cayley graph on symmetric group generated by elements fixing \(k\) points
• On the eigenvalues of certain Cayley graphs and arrangement graphs
• Solving the Ku-Wales conjecture on the eigenvalues of the derangement graph
• Forbidding just one intersection, for permutations
• A proof of the Cameron-Ku conjecture
• Generating a random permutation with random transpositions
• ON EIGENVALUES AND COLORINGS OF GRAPHS, II
• Intersecting families of permutations

This page was built for publication: On the partition associated to the smallest eigenvalues of the \(k\)-point fixing graph