Skip to main content

Estimating the connectivity of a graph

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

Abstract

Although the results above seem to yield good estimators of an upper bound on connectivity, they can easily give rather poor estimates of k itself. One possible improvement could be effected by using the theorem of Harary and Chartrand [2] that δ≥p−2+n / 2 for some n such that 1≤n≤p−1 implies k≧n. This could give an estimate of a lower bound on k by using δ* in place of δ in the above inequality. Of course, the usefulness of this is limited to cases in which δ* is rather large, at least 1/2 p.

Further approaches to this problem based on testing the hypothesis that k=1 will hopefully be the subject of a future paper.

Keywords

  • Minimum Degree
  • Unbiased Estimator
  • Poor Estimate
  • Bias Approach
  • Star Sample

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 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. M. Capobianco, Statistical inference in finite populations having structure, Trans. New York Acad. Sci. 32 (1970), 401–143.

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. G. Chartrand and F. Harary, Graphs with prescribed connectivities, Theory of Graphs, (P. Erdös and G. Katona, Eds.) Akademiai Kiado, Budapest, (1968), 61–63.

    Google Scholar 

  3. P. Zweig Chinn, The frequency partition of a graph, Recent Trends in Graph Theory, (M. Capobianco, J. Frechen, M. Krolik, Eds.), Springer-Verlag, (1971).

    Google Scholar 

  4. F. Harary, The maximum connectivity of a graph, Proc. Nat. Acad. Sci. USA 48 (1962), 1142–1146.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. H. Whitney, Congruent graphs and the connectivity of graphs, Amer. J. Math. 54 (1932), 150–168.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1972 Springer-Verlag

About this paper

Cite this paper

Capobianco, M. (1972). Estimating the connectivity of a graph. In: Alavi, Y., Lick, D.R., White, A.T. (eds) Graph Theory and Applications. Lecture Notes in Mathematics, vol 303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0067358

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06096-3

  • Online ISBN: 978-3-540-38114-3

  • eBook Packages: Springer Book Archive