Cayley graph on symmetric group generated by elements fixing \(k\) points
From MaRDI portal
Publication:2261552
DOI10.1016/j.laa.2015.01.006zbMath1307.05143arXiv1405.6462MaRDI QIDQ2261552
Terry Shue Chien Lau, Cheng Yeaw Ku, Kok Bin Wong
Publication date: 6 March 2015
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.6462
Related Items
Largest independent sets of certain regular subgraphs of the derangement graph, The smallest eigenvalues of the 1-point fixing graph, Eigenvalues of the matching derangement graph, Integral Cayley graphs over dihedral groups, The spectrum of eigenvalues for certain subgraphs of the \(k\)-point fixing graph, Integral Cayley graphs over dicyclic group, Automorphism group of the complete alternating group graph, The second largest eigenvalues of some Cayley graphs on alternating groups, On the partition associated to the smallest eigenvalues of the \(k\)-point fixing graph
Cites Work
- 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
- The number of shortest paths in the arrangement graph
- Conditional matching preclusion for the arrangement graphs
- 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
- Recurrences for characters of the symmetric group
- Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
- The paths embedding of the arrangement graphs with prescribed vertices in given position
- Conditional fault tolerance of arrangement graphs
- The edge-centered surface area of the arrangement graph
- On the eigenvalues of certain Cayley graphs and arrangement graphs
- Solving the Ku-Wales conjecture on the eigenvalues of the derangement graph
- On the arrangement graph.
- Generating a random permutation with random transpositions
- Linearly many faults in arrangement graphs