Skip to main content
SpringerLink
Log in

A remark on bipartite distance-regular graphs of even valency

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

LetГ be a bipartite distance-regular graph of even valencyk. Let us consider the intersection array modulo 2, which would become

Lett be the length of any series of (1, 0, 1)'s witht > 1. Thent + 1|r 1 + 1, withr 1 the length of the first series.

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 I, Benjamin, California (1984)

    Google Scholar 

  2. Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance-Regular Graphs, Springer Verlag, Berlin, Heidelberg (1989)

    Google Scholar 

  3. Terwilliger, P.: The diameter of bipartite distance-regular graphs. J. Comb. Theory Ser. B32, 182–188 (1982)

    Article  Google Scholar 

  4. Terwilliger, P.: Distance-regular graphs and (s, c, a, k)-graphs. J. Comb. Theory Ser. B34, 151–164 (1983)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tokyo Ikashika University, 272, Kounodai, Ichikawa, Chiba, Japan

    K. Nomura

Authors
  1. K. Nomura
    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

Nomura, K. A remark on bipartite distance-regular graphs of even valency. Graphs and Combinatorics 11, 139–140 (1995). https://doi.org/10.1007/BF01929483

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation