G Arunkumar, PJ Cameron, R Ganeshbabu… - arXiv preprint arXiv …, 2024 - arxiv.org
Let A be a graph type and B an equivalence relation on a group $ G $. Let $[g] $ be the equivalence class of $ g $ with respect to the equivalence relation B. The B superA graph of …
Y Li, B Xia, S Zhou - European Journal of Combinatorics, 2023 - Elsevier
Aldous' spectral gap conjecture states that the second largest eigenvalue of any connected Cayley graph on the symmetric group S n with respect to a set of transpositions is achieved …
CY Ku, KB Wong - Journal of Algebraic Combinatorics, 2018 - Springer
In this paper, we derive a formula for the eigenvalues of the matching derangement graph. The formula gives an insight regarding the alternating sign conjecture for the eigenvalues of …
ZKS Koh, CY Ku, KB Wong - Journal of Combinatorial Theory, Series A, 2023 - Elsevier
It was conjectured in the monograph [9] by Godsil and Meagher and in the article [10] by Lindzey that the perfect matching derangement graph M 2 n possesses the alternating sign …
M Ebrahimi - arXiv preprint arXiv:2302.00929, 2023 - arxiv.org
Let $ S_n $ denote the symmetric group on $ n $ letters. The $ k $-point fixing graph $\mathcal {F}(n, k) $ is defined to be the graph with vertex set $ S_n $ and two vertices $ g, h …
CY Ku, T Lau, KB Wong - European Journal of Combinatorics, 2017 - Elsevier
Let S n be the symmetric group on [n]={1,…, n}. The k-point fixing graph F (n, k) is defined to be the graph with vertex set S n such that two vertices g, h of F (n, k) are joined if and only if …
CY Ku, T Lau, KB Wong - Linear Algebra and its Applications, 2018 - Elsevier
Let S n be the symmetric group on n-points. The k-point fixing graph F (n, k) is defined to be the graph with vertex set S n and two vertices g, h of F (n, k) are joined if and only if gh− 1 …
Let S n be the symmetric group on [n]={1,..., n}. The k-point fixing graph, F (n, k) is defined to be the graph with vertex set Sn and two vertices g and h of F (n, k) are joined if and only if …
Let Sn be the symmetric group on [n]={1,..., n}. The k-point fixing graph, F (n, k) is defined to be the graph with vertex set Sn and two vertices g and h of F (n, k) are joined if and only if …