Homogeneous Graphs and Regular Near Polygons

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on Regular Near Polygons

In this note we prove several inequalities for regular near polygons. ∗This work was partly supported by the Grant-in-Aid for Scientific Research (No 14740072), the Ministry of Education, Science and Culture, JAPAN. †This work was partly done when the author was at the ComMaC center at the Pohang University of Science and Technology. He would like to thank the ComMaC-KOSEF for its support.

متن کامل

An inequality for regular near polygons

Let Γ denote a near polygon distance-regular graph with diameter d ≥ 3, valency k and intersection numbers a1 > 0, c2 > 1. Let θ1 denote the second largest eigenvalue of Γ. We show θ1 ≤ k − a1 − c2 c2 − 1 . We show the following (i)–(iii) are equivalent. (i) Equality is attained above; (ii) Γ is Q-polynomial with respect to θ1; (iii) Γ is a dual polar graph or a Hamming graph.

متن کامل

A Higman inequality for regular near polygons

The inequality of Higman for generalized quadrangles of order (s, t) with s > 1 states that t ≤ s. We will generalize this by proving that the intersection number ci of a regular near 2d-gon of order (s, t) with s > 1 satisfies the tight bound ci ≤ (s − 1)/(s − 1), and we give properties in case of equality. It is known that hemisystems in generalized quadrangles meeting the Higman bound induce...

متن کامل

Pseudo 1-homogeneous distance-regular graphs

Let be a distance-regular graph of diameter d ≥ 2 and a1 = 0. Let θ be a real number. A pseudo cosine sequence for θ is a sequence of real numbers σ0, . . . , σd such that σ0 = 1 and ciσi−1 + aiσi + biσi+1 = θσi for all i ∈ {0, . . . , d−1}. Furthermore, a pseudo primitive idempotent for θ is Eθ = s ∑di=0 σiAi , where s is any nonzero scalar. Let v̂ be the characteristic vector of a vertex v ∈ V...

متن کامل

Quadrance polygons, association schemes and strongly regular graphs

Quadrance between two points A1 = [x1, y1] and A2 = [x2, y2] is the number Q(A1, A2) := (x2 − x1) + (y2 − y1). In this paper, we present some interesting results arise from this notation. In Section 1, we will study geometry over finite fields under quadrance notations. The main purpose of Section 1 is to answer the question, for which a1, . . . an, we have a polygon A1 . . . An such that Q(Ai,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 1994

ISSN: 0095-8956

DOI: 10.1006/jctb.1994.1006