Skip to main content
SpringerLink
Log in
Book cover

Generalized Connectivity of Graphs pp 41–57Cite as

Sharp Bounds of the Generalized (Edge-)Connectivity

  • Chapter
  • First Online:

  • 900 Accesses

Part of the book series: SpringerBriefs in Mathematics ((BRIEFSMATH))

Abstract

From the last chapter, we know that it is almost impossible to get the exact value of the generalized (edge-)connectivity for a given arbitrary graph. So people tried to give some nice bounds for it, especially sharp upper and lower bounds.

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

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

Learn about institutional subscriptions

Bibliography

  1. Bondy, J.A., Murty, U.S.R.: Graph Theory, GTM 244. Springer, New York (2008)

    Book  MATH  Google Scholar 

  2. Chartrand, G., Stewart, M.J.: The connectivity of line graphs. Math. Ann. 182, 170–174 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  3. Kriesell, M.: Edge-disjoint trees containing some given vertices in a graph. J. Combin. Theory Ser. B 88 (1), 53–65 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  4. Li, H., Li, X., Mao, Y., Sun, Y.: Note on the generalized connectivity. Ars Combin. 114, 193–202 (2014)

    MathSciNet  MATH  Google Scholar 

  5. Li, S.: Some topics on generalized connectivity of graphs. Thesis for Doctor Degree, Nankai University (2012)

    Google Scholar 

  6. Li, S., Li, X., Zhou, W.: Sharp bounds for the generalized connectivity κ 3(G). Discrete Math. 310 (15-16), 2147–2163 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. Li, X., Mao, Y.: Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs. Discrete Appl. Math. 185, 102–112 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  8. Li, X., Mao, Y.: The minimal size of a graph with given generalized 3-edge-connectivity. Ars Combin. 118, 63–72 (2015)

    MathSciNet  MATH  Google Scholar 

  9. Li, X., Mao, Y., Sun, Y.: On the generalized (edge-)connectivity of graphs. Australasian J. Combin. 58 (2), 304–319 (2014)

    MathSciNet  MATH  Google Scholar 

  10. Mader, W.: Eine reduktionsmethode für den kantenzusammenhang in graphen. Math. Nachr. 93, 187–204 (1979)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Combinatorics, Nankai University, Tianjin, China

    Xueliang Li & Yaping Mao

Authors
  1. Xueliang Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yaping Mao
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2016 The Author(s)

About this chapter

Cite this chapter

Li, X., Mao, Y. (2016). Sharp Bounds of the Generalized (Edge-)Connectivity. In: Generalized Connectivity of Graphs. SpringerBriefs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-33828-6_4

Download citation

Publish with us

Policies and ethics

Search

Navigation