Skip to main content

Random subgraphs of regular graphs

  • 477 Accesses

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

Abstract

Let G denote a connected r-regular labelled graph. Denote by RG(p) any subgraph of G having the same point set as G and line set defined by selecting or rejecting each of the lines of G with independent probability p or q=1−p, respectively. Since RG(p) is the outcome of a random process, RG(p) is called a random subgraph of G and is studied with the appropriate probabilistic considerations.

We derive some general properties of RG(p). In particular, we obtain the generating function for the point degree distribution of RGj(p), the subgraph of RG(p) induced by the points of RG(p) having degree greater than or equal to j. We also comment on a possible relation between pc, the critical probability for the existence of an infinite order component in RG(p), and p cr , the analogous critical probability for RGr (p).

Keywords

  • Random Graph
  • Regular Graph
  • Probability Generate Function
  • Infinite Order
  • Critical Probability

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This work was supported by grants from Research Corporation, the Pace University Scholarly Research Committee, and the Kenan Fund.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Erdös and Rényi, On random graphs I., Publ. Math. Debrecen 6 (1959), 290–297.

    MathSciNet  MATH  Google Scholar 

  2. E. N. Gilbert, Random graphs, Annals Math. Stat. 30 (1959), 1141–1144.

    CrossRef  MATH  Google Scholar 

  3. T. L. Austin, R. E. Fagen, W. F. Penny, and J. Riordan, The Number of components in random linear graphs, Annals Math. Stat. 30 (1959), 747–754.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. M. Karónski, A review of random graphs, J. Graph Theory 6 (1982), 349–389.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. G. S. Bloom, J. W. Kennedy, M. T. Mandziuk, and L. V. Quintas, Random graphs and the physical world, Proceedings of the Graph Theory Conference dedicated to the memory of Kazimierz Kuratowski, Lagów, Poland, February 1981, Springer-Verlag (1983), 94–110.

    Google Scholar 

  6. J. W. Kennedy, The random-graph-like state of matter, Proceedings of the 6th International Conference on Computers in Chemical Research and Education, Georqetown University, Washington D. C., July 1982, Elsevier, Science Pub. B. V., Amsterdam (1983), 151–178.

    Google Scholar 

  7. H. Kesten, Percolation Theory for Mathematicians, Birkhäuser Boston, Inc., Boston; Basel; Stuttgart; 1982, 423 pp.

    CrossRef  MATH  Google Scholar 

  8. L. V. Quintas, A volume function for water based on a random lattice-subgraph model, Symposium on Chemical Applications of Topology and Graph Theory, University of Georgia, Athens, GA, April 1983, (to appear).

    Google Scholar 

  9. P. L. Meyer, Introductory Probability and Statistics Applications, Addison-Wesley Pub. Company, Inc., 1965, (Second Printing 1966), 339 pp.

    Google Scholar 

  10. L. V. Cuintas, M. Klein, and F. Vazquez, A relation between random lattice-graphs and a volume function for water, Report: Cottrell College Science Grant Summer '82 (November '82).

    Google Scholar 

  11. H. E. Stanley and J. Teixeira, Interpretation of the unusual behavior of H2O and D2O at low temperatures: Tests of a percolation model, J. Chem. Phys. 73(7) (1980), 3404–3422.

    CrossRef  MathSciNet  Google Scholar 

  12. A. Geiger, F. H. Stillinger, and A. Rahman, Aspects of the percolation process for hydrogen-bond networks in water, J. Chem. Phys. 70(9) (1979),4185–4193.

    CrossRef  Google Scholar 

  13. J. W. Kennedy, Icycles-I, The Theory and Applications of Graphs (Fourth International Conference, Western Michigan University, Kalamazoo, MI, May 1980) John Wiley & Sons, New York (1981), 409–429.

    Google Scholar 

  14. S. A. Rice and M. G. Sceats, A random model for water, J. Phys. Chem. 85 (1981), 1108–1119.

    CrossRef  Google Scholar 

  15. J. W. Kennedy, Statistical mechanics and large random graphs, Data Processing in Chemistry, Rzeszów, 1980, Elsevier & Polish Scientific Publishers, (1981), 96–114.

    Google Scholar 

  16. H. E. Stanley, A polychromatic correlated-site percolation problem with possible relevance to the unusual behavior of supercooled H2O and D2O, J. Phys. A: Math. Gen., Vol. 12(12) (1979), L329–L337.

    CrossRef  Google Scholar 

  17. H. E. Stanley and J. Teixeira, Are the concepts of percolation and gelation of possible relevance to the behavior of water at very low temperatures? Ferroelectrics, Vol. 30 (1980), 213–226.

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1984 Springer-Verlag

About this paper

Cite this paper

Quintas, L.V. (1984). Random subgraphs of regular graphs. In: Koh, K.M., Yap, H.P. (eds) Graph Theory Singapore 1983. Lecture Notes in Mathematics, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0073113

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13368-1

  • Online ISBN: 978-3-540-38924-8

  • eBook Packages: Springer Book Archive