Classical Distance-Regular Graphs of Negative Type

30Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We prove the following theorem. \emsp;Theorem.Let Γ=(X, R)denote a distance-regular graph with classical parameters(d, b, α, β)and d≥4.Suppose b 1.Then precisely one of the following(i)-(iii)holds. (i)Γ is the dual polar graph2A2d-1(-b). (ii)Γ is the Hermitian forms graph Her-b(d). (iii)α=(b-1)/2,β=-(1+bd)/2,and-b is a power of an odd prime. © 1999 Academic Press.

Cite

CITATION STYLE

APA

Weng, C. wen. (1999). Classical Distance-Regular Graphs of Negative Type. Journal of Combinatorial Theory. Series B, 76(1), 93–116. https://doi.org/10.1006/jctb.1998.1892

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free