The diameter of random regular graphs

Abstract

We give asymptotic upper and lower bounds for the diameter of almost everyr-regular graph onn vertices (n → ∞).

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

References

  1. [1]

    E. A. Bender andE. R. Canfield, The asymptotic number of labelled graphs with given degree sequences,J. Combinatorial Theory (A) 24 (1978) 296–307.

    MATH  Article  MathSciNet  Google Scholar 

  2. [2]

    B. Bollobás,Extremal Graph Theory, Academic Press, London, New York and San Francisco, 1978.

    Google Scholar 

  3. [3]

    B. Bollobás, A probabilistic proof of an asymptotic formula for the number of labelled regular graphs,Europ. J. Combinatorics 1 (1980). 311–316.

    MATH  Google Scholar 

  4. [4]

    B. Bollobás, The diameter of random graphs,Trans. Amer. Math. Soc. 267 (1981) 41–52.

    MATH  Article  MathSciNet  Google Scholar 

  5. [5]

    V. Klee andD. Larman, Diameters of random graphs,Canad. J. Math. 33 (1981) 618–640.

    MATH  MathSciNet  Google Scholar 

  6. [6]

    A. D. Korshunov, On the diameter of random graphs,Soviet Mat. Doklady 12 (1971) 302–305.

    MATH  Google Scholar 

Download references

Author information

Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Bollobás, B., Fernandez de la Vega, W. The diameter of random regular graphs. Combinatorica 2, 125–134 (1982). https://doi.org/10.1007/BF02579310

Download citation

AMS subject classification (1980)

  • 05 C 99
  • 60 C 05