Construction of Cospectral Cayley Digraphs over Dihedral Group D_(6p)  

作　　者：Jing Yang Lang Tang Weijun Liu Lihua Feng 

机构地区：[1]School of Mathematics and Statistics,HNP-LAMA Central South University,Changsha 410083,China [2]School of Mathematics and Statistics,Hunan First Normal University Changsha 410205,China

出　　处：《Algebra Colloquium》2024年第4期629-638,共10页代数集刊（英文版）

基　　金：L.H.Feng and W.J.Liu were supported by NSFC(Nos.12271527,12471022);L.Tang was supported by NSFC(No.12201202);Hunan Provincial Natural Science Foundation(Nos.2020JJ5096,2020JJ4233).

摘　　要：Let G be a finite group and S G\(e),where e denotes the identity element of G.The Cayley digraph X(G,S)of G over the set S is the graph with vertex set G and edge set((a,sa)I E G,s E S).Two graphs are called cospectral if their adjacency matrices have the same spectrum.We construct a large family of cospectral non-isomorphic Cayley digraphs over the dihedral group of order 6p for p≥11.

关 键 词：Cayley digraph dihedral group cospectral 

分 类 号：O152[理学—数学]