On absolute bound for Hermitian adjacency matrices of digraphs

发布时间：2019-04-23 作者：浏览次数：

Speaker:	Alexander Gavrilyuk	DateTime:	2019年4月25日（周四）上午10:30-11:30
Brief Introduction to Speaker:		Place:	六号楼二楼报告厅
Abstract:Although it is likely that almost all graphs have simple eigenvalues only, many interesting highly structured graphs (such as strongly regular and distance-regular graphs)have eigenvalues of relatively large multiplicities. In 1977, Delsarte, Goethals, and Seidel in their study on spherical codes and designs obtained the following result in graph theory.