Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

A relationship between the diameter and the intersection number c 2 for a distance-regular graph

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

In this paper we will look at the relationship between the intersection number c 2 and the diameter of a distance-regular graph. We also give some tools to show that a distance-regular graph with large c 2 is bipartite, and a tool to show that if k D is too small then the distance-regular graph has to be antipodal.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Biggs N.L., Boshier A.G., Shawe-Taylor J.: Cubic distance-regular graphs. J. Lond. Math. Soc. 33, 385–394 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  2. Brouwer A.E., Cohen A.M., Neumaier A.: Distance-regular graphs. Springer-Verlag, Berlin (1989)

    MATH  Google Scholar 

  3. Caughman J.S. IV.: Intersection numbers of bipartite distance-regular graphs. Discret. Math. 163, 235–241 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  4. Godsil C., Royle G.: Algebraic graph theory. Springer-Verlag, Berlin (2001)

    Book  MATH  Google Scholar 

  5. Haemers W.H.: Interlacing eigenvalues and graphs. Linear Algebra Appl. 226(228), 593–616 (1995)

    Article  MathSciNet  Google Scholar 

  6. Koolen J.H.: On subgraphs in distance-regular graphs. J. Algebraic Combin. 1(4), 353–362 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  7. Koolen J.H., Park J.: Distance-regular graphs with a 1 or c 2 at least half the valency. J. Comb. Theory A 119(3), 546–555 (2012)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, POSTECH, Pohang, 790-785, South Korea

    Jack H. Koolen & Jongyook Park

Authors
  1. Jack H. Koolen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jongyook Park
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jongyook Park.

Additional information

This is one of several papers published together in Designs, Codes and Cryptography on the special topic: “Geometric and Algebraic Combinatorics”.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Koolen, J.H., Park, J. A relationship between the diameter and the intersection number c 2 for a distance-regular graph. Des. Codes Cryptogr. 65, 55–63 (2012). https://doi.org/10.1007/s10623-011-9600-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-011-9600-3

Keywords

Mathematics Subject Classification (2000)

Search

Navigation