Skip to main content
SpringerLink
Log in

Maximum Generalized Local Connectivity

  • Chapter
  • First Online:
Generalized Connectivity of Graphs

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

  • 898 Accesses

Abstract

In this chapter, we introduce the results on the extremal problems of the generalized connectivity and generalized edge-connectivity.

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

Access this chapter

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

Institutional subscriptions

Bibliography

  1. Bártfai, P.: Solution of a problem proposed by P. Erdös (in Hungarian). Mat. Lapok. 175–140 (1960)

    Google Scholar 

  2. Bollobás, B.: Extremal Graph Theory. Academic press, New York (1978)

    MATH  Google Scholar 

  3. Bollobás, B.: Cycles and semi-topological configurations, inTheory and Applications of graphs’, ed. by Y. Alavi, D.R. Lick, Lecture Notes Math. vol. 642, pp. 66–74. Springer, New York (1978)

    Google Scholar 

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

    Book  MATH  Google Scholar 

  5. Leonard, J.L.: On a conjecture of Bollobás and Edrös. Period. Math. Hungar.3, 281–284 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  6. Leonard, J.L.: Graphs with 6-ways. Can. J. Math.25, 687–692 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  7. Li, H., Li, X., Mao, Y.: On extremal graphs with at most two internally disjoint Steiner trees connecting any three vertices. Bull. Malays. Math. Sci. Soc.37 (3), 747–756 (2014)

    MathSciNet  MATH  Google Scholar 

  8. Li, X., Mao, Y.: On extremal graphs with at mostℓ internally disjoint Steiner trees connecting anyn − 1 vertices. Graphs Combin.31 (6), 2231–2259 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  9. Li, X., Zhao, Y.: On graphs with only one Steiner tree connecting anyk vertices. arXiv:1301.4623v1 [math.CO] (2013)

    Google Scholar 

  10. Mader, W.: Ein extremalproblem des zusammenhangin endlichen graphen. Math. Z.131, 223–231 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  11. Mader, W.: Grad und lokaler zusammenhangs von graphen. Math. Ann.205, 9–11 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  12. Sun, Y.: Maximum generalized local connectivities of cubic Cayley graphs on Abelian groups. J. Combin. Math. Combin. Comput.94, 227–236 (2015)

    MathSciNet  MATH  Google Scholar 

  13. Sørensen, B.A., Thomassen, C.: Onk-rails in graphs. J. Comb. Theory Ser. B17 (2), 143–159 (1974)

    Article  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). Maximum Generalized Local Connectivity. In: Generalized Connectivity of Graphs. SpringerBriefs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-33828-6_8

Download citation

Publish with us

Policies and ethics

Search

Navigation