A note on regular near polygons

被引：4

作者：

Hiraki, A

Koolen, J

机构：

[1] Osaka Kyoiku Univ, Div Math Sci, Osaka 5828582, Japan

[2] Korea Adv Inst Sci & Technol, Div Appl Math, Taejon 305701, South Korea

[3] Pohang Univ Sci & Technol, Com2MaC Ctr, Pohang, South Korea

来源：

GRAPHS AND COMBINATORICS | 2004年 / 20卷 / 04期

关键词：

regular near polygon; distance-regular graph;

D O I：

10.1007/s00373-004-0584-x

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let Gamma be a regular near polygon of order (s, t) with s > 1 and t greater than or equal to 3. Let d be the diameter of Gamma, and let r : = max{i\ (c(i); a(i); b(i)) = (c(1); a(1); b(1))}: In this note we prove several inequalities for Gamma. In particular, we show that s is bounded from above by function in t if d < 3/2 (r + 1). We also consider regular near polygons of order (s, 3).

引用

页码：485 / 497

页数：13

共 12 条

[1]

[Anonymous], ANN COMB

[2]

[Anonymous], 1974, CAMBRIDGE TRACTS MAT

[3] A bound for the number of columns l(c,a,b) in the intersection array of a distance-regular graph [J].