The application of representation theory in directed strongly regular graphs
Abstract
The concept of directed strongly regular graphs (DSRG) was introduced by Duval in 1988 A.In the present paper,we use representation theory of finite groups in order to investigate the directed strongly regular Cayley graphs.We first show that a Cayley graph C(G,S) is not a directed strongly regular graph if S is a union of some conjugate classes of G.This generalizes an earlier result of Leif K.Jrgensen J1 on abelian groups.Secondly,by using induced representations,we have a look at the Cayley graph C(Nθ H, N1× H1) with N1⊂eq N and H1⊂eq H,determining its characteristic polynomial and its minimal polynomial.Based on this result,we generalize the semidirect product method of Art M. Duval and Dmitri Iourinski in D and obtain a larger family of directed strongly regular graphs.Finally,we construct some directed strongly regular Cayley graphs on dihedral groups,which partially generalize the earlier results of Mikhail Klin,Akihiro Munemasa,Mikhail Muzychuk,and Paul Hermann Zieschang in K1.By using character theory,we also give the characterization of directed strongly regular Cayley graphs C(Dn,X Xa) with X X(-1)=.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.