On Automorphisms of Distance-Regular Graphs with Intersection Array {56,45,1;1,9,56}

被引：51

作者：

Gavrilyuk, A. L. ^{[1
]}

Makhnev, A. A. ^{[1
]}

机构：

[1] Russian Acad Sci, Inst Math & Mech, Ural Div, Ekaterinburg 620219, Russia

来源：

DOKLADY MATHEMATICS | 2010年 / 81卷 / 03期

基金：

俄罗斯基础研究基金会;

关键词：

Adjacency Matrix; Regular Graph; DOKLADY Mathematic; Adjacent Vertex; Rational Class;

D O I：

10.1134/S1064562410030282

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The distance regular graphs in which the neighborhoods of vertices are isomorphic to the Gewirtz graph is discussed. The Gewirtz graph is the only strongly regular graph with parameters (56, 10, 0, 2). The theorem is proved by Higman's method for automorphisms of a distance regular graph. An irreducible rational representation is a rational representation that is irreducible over the field of rational numbers.

引用

页码：439 / 442

页数：4