English

The application of representation theory in directed strongly regular graphs

Combinatorics 2018-05-28 v4

Abstract

The concept of directed strongly regular graphs (DSRG) was introduced by Duval in 1988 \cite{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)\mathcal{C}(G,S) is not a directed strongly regular graph if SS is a union of some conjugate classes of GG.This generalizes an earlier result of Leif K.J{\o}rgensen \cite{J1} on abelian groups.Secondly,by using induced representations,we have a look at the Cayley graph C(NθH,N1×H1)\mathcal{C}(N\rtimes_\theta H, N_1\times H_1) with N1NN_1\subseteq N and H1HH_1\subseteq 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 \cite{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 \cite{K1}.By using character theory,we also give the characterization of directed strongly regular Cayley graphs C(Dn,XXa)\mathcal{C}(D_n,X\cup Xa) with XX(1)=X\cap X^{(-1)}=\emptyset.

Keywords

Cite

@article{arxiv.1707.07789,
  title  = {The application of representation theory in directed strongly regular graphs},
  author = {Yiqin He and Bicheng Zhang},
  journal= {arXiv preprint arXiv:1707.07789},
  year   = {2018}
}

Comments

27 pages