Automorphisms of a distance-regular graph with intersection array {176,150,1; 1,25,176}

被引：2

作者：

Belousov, Ivan Nikolaevich ^{[1
]}

Makhnev, Alexandr Alekseevich ^{[1
]}

机构：

[1] NN Krasovsky Inst Math & Meckhan, Str S Kovalevskoy 16, Ekaterinburg 620990, Russia

来源：

SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA | 2016年 / 13卷

关键词：

distance-regular graph; automorphism;

D O I：

10.17377/semi.2016.13.061

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We study automorphisms of a hypothetical distance-regular graph with intersection array { 176, 150, 1; 1, 25, 176 }. It is proved that a distance- regular graph with intersection array { 176, 150, 1; 1, 25, 176 } is not vertex- transitive.

引用

页码：754 / 761

页数：8

共 6 条

[1] On extensions of strongly regular graphs without triangles with eigenvalue 3 [J].

Belousov, I. N. ;

Makhnev, A. A. .

DOKLADY MATHEMATICS, 2014, 90 (01) :395-398

[2]

Brouwer A.E., 1989, DISTANCE REGULAR GRA

[3]

Cameron P. J., 1999, LONDON MATH SOC STUD, V45

[4] On Automorphisms of Distance-Regular Graphs with Intersection Array {56,45,1;1,9,56} [J].

Gavrilyuk, A. L. ;

Makhnev, A. A. .

DOKLADY MATHEMATICS, 2010, 81 (03) :439-442

[5] An automorphism group of a distance-regular graph with intersection array {24,21,3;1,3,18} [J].

Makhnev, A. A. ;

Paduchikh, D. V. .

ALGEBRA AND LOGIC, 2012, 51 (04) :319-332

[6]

Zavarnitsine AV, 2009, SIB ELECTRON MATH RE, V6, P1

← 1 →