Skip to main content

Connectivity in digraphs

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

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. W. G. Brown and F. Harary, Extremal digraphs. Combinatorial Mathematics and its Applications (P. Erdös, Ed.) Budapest, to appear.

    Google Scholar 

  2. G. Chartrand, A graph-theoretic approach to a communications problem. J. SIAM Appl. Math. 14 (1966) 778–781.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. G. Chartrand and F. Harary, Graphs with prescribed connectivities. Theory of Graphs (P. Erdös and G. Katona, Eds.) Akadémiai Kiadó, Budapest, 1968, 61–63.

    Google Scholar 

  4. D. P. Geller, Minimally strong digraphs, Proc. Edinburgh Math. Soc., 17, Part 1 (1970), to appear.

    Google Scholar 

  5. R. Halin, A theorem on n-connected graphs, J. Combinatorial Theory 7 (1969) 150–154.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. F. Harary, The maximum connectivity of a graph. Proc. Nat. Acad. Sci. USA 1142–1146.

    Google Scholar 

  7. F. Harary, Graph Theory. Addison-Wesley, Reading, Mass., 1969.

    MATH  Google Scholar 

  8. F. Harary, Variations on a theorem by Menger, SIAM Studies in Applied Math. Vol. 4, to appear.

    Google Scholar 

  9. F. Harary, R. Z. Norman, and D. Cartwright, Structural Models: an introduction to the theory of directed graphs. Wiley, New York, 1965.

    MATH  Google Scholar 

  10. B. Manvel, P. Stockmeyer, and D. J. A. Welsh, On removing a point of a digraph, Studia Sci. Math. Hung., to appear.

    Google Scholar 

  11. J. W. Moon, Topics on Tournaments, Holt, Rinehart and Winston, New York, 1968.

    MATH  Google Scholar 

  12. C. St. J. A. Nash-Williams, Well-balanced orientations of finite graphs and unobtrusive odd-vertex-pairing, Recent Progress in Combinatorics (W. T. Tutte, Ed.) Academic Press, New York, 1969, pp. 133–149.

    Google Scholar 

  13. W. T. Tutte, The Connectivity of Graphs, Toronto Univ. Press, Toronto, 1967.

    MATH  Google Scholar 

  14. 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

© 1971 Springer-Verlag

About this paper

Cite this paper

Geller, D., Harary, F. (1971). Connectivity in digraphs. In: Capobianco, M., Frechen, J.B., Krolik, M. (eds) Recent Trends in Graph Theory. Lecture Notes in Mathematics, vol 186. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0059429

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-05386-6

  • Online ISBN: 978-3-540-36508-2

  • eBook Packages: Springer Book Archive