Skip to main content

The distribution of degrees in random graphs

  • Conference paper
  • First Online:
Graph Theory

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1018))

  • 1376 Accesses

Abstract

This paper is aimed at surveying some results and unsolved problems concerning the distribution of degrees of vertices in two kinds of random graphs. Some related topics are also presented. No proofs are included, but references to them are given.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Bollobás, Graph theory — An introductory course, Graduate Text in Math. No 63, (1979).

    Google Scholar 

  2. B. BollobĂĄs, Degree sequences of random graphs, Aarhus Univer., Preprint Series No 9, (1978/1979).

    Google Scholar 

  3. P. Erdös, A. RĂ©nyi, On random graphs I, Publ. Math. Debrecen 6 (1959), 290–297.

    MathSciNet  MATH  Google Scholar 

  4. P. Erdös, A. RĂ©nyi, On the evolution of random graphs, Publ. Math. Inst. Hung. Acad. Sci, 5 (1960), 17–61.

    MathSciNet  MATH  Google Scholar 

  5. P. Erdös, A. RĂ©nyi, On the strength of connectedness of a random graph, Acta Math. Sci. Hung. 12 (1961), 261–267.

    Article  MathSciNet  MATH  Google Scholar 

  6. O. Frank, Statistical inference in graphs, Stockholm (1971).

    Google Scholar 

  7. G. Grimmett, Random graphs, in print.

    Google Scholar 

  8. G. Ivchenko, On the asymptotic behaviour of degrees of vertices in a random graph, Th. Prob. Appl. 18, 1 (1973), 188–195.

    Article  Google Scholar 

  9. G. Ivchenko, The strength of connectivity of a random graph, Th. Prob. Appl. 18, 2 (1973), 396–403.

    Article  Google Scholar 

  10. M. KaroƄski, A review of random graphs, J. Graph Theory, 6 (1982), 349–389.

    Article  MathSciNet  MATH  Google Scholar 

  11. I. Palasti, On the connectedness of bichromatic random graphs, Publ. Math. Inst. Hung. Acad. Sci. 8 (1963), 431–440.

    MathSciNet  MATH  Google Scholar 

  12. Z. Palka, On pendant vertices in random graphs, Coll. Math., in print.

    Google Scholar 

  13. Z. Palka, On the number of vertices of given degree in a random graph, to appear.

    Google Scholar 

  14. Z. Palka, On the degrees of vertices in a bichromatic random graph, to appear.

    Google Scholar 

  15. A. RuciƄski, The r-connectedness of k-partite random graph, Bull. Polish Acad. Sci., Ser. Sci. Math. 29 (1981), 321–330.

    MathSciNet  MATH  Google Scholar 

  16. V. Stepanov, Random graphs, Voprosy Kibern., Moskwa, (1973), 164–185.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

M. Borowiecki John W. Kennedy Maciej M. SysƂo

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag

About this paper

Cite this paper

Palka, Z. (1983). The distribution of degrees in random graphs. In: Borowiecki, M., Kennedy, J.W., SysƂo, M.M. (eds) Graph Theory. Lecture Notes in Mathematics, vol 1018. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0071626

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12687-4

  • Online ISBN: 978-3-540-38679-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics