Skip to main content
SpringerLink
Log in

Kite-freeP- andQ-polynomial schemes

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

LetY = (X, {R i } o≤i≤d) denote aP-polynomial association scheme. By a kite of lengthi (2 ≤ i ≤ d) inY, we mean a 4-tuplexyzu (x, y, z, u ∈ X) such that(x, y) ∈ R 1,(x, z) ∈ R 1,(y, z) ∈ R 1,(u, y) ∈ R i−1,(u, z) ∈ R i−1,(u, x) ∈ R i. Our main result in this paper is the following.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bannai, E., Ito, T.: Algebraic Combinatorics: Association Schemes, Benjamin-Cummings Lecture Note 58. Menlo Park (1984)

  2. Brouwer, A., Cohen, A., Neumaier, A.: Distance-Regular Graphs, Springer Verlag, New York (1989)

    Google Scholar 

  3. Terwilliger, P.: The subconstituent algebra of an association scheme, I. J. Alg. Combin.1, 363–388 (1992)

    Article  Google Scholar 

  4. Terwilliger, P.: A New Inequality for Distance-Regular Graphs. Discrete Math, 319–332 (1995)

  5. Terwilliger, P.: Kite-Free Distance-Regular Graphs. Europ. J. Combin (to be published)

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Wisconsin, 480 Lincoln Dr., 53706, Madison, WI, USA

    Chih-Wen Weng

Authors
  1. Chih-Wen Weng
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Weng, CW. Kite-freeP- andQ-polynomial schemes. Graphs and Combinatorics 11, 201–207 (1995). https://doi.org/10.1007/BF01929487

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01929487

Keywords

Search

Navigation