Skip to main content
SpringerLink
Log in
Book cover

Generalized Connectivity of Graphs pp 15–29Cite as

Results for Some Graph Classes

  • Chapter
  • First Online:

  • 897 Accesses

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

Abstract

In this chapter, we study the generalized k-connectivity for some special graph classes. As one will see, even for special graphs, it is not easy to get the exact values of the generalized connectivity for them. The following two observations are easily seen.

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. Babai, L.: Automorphism groups, isomorphism, reconstruction, Handbook of Combinatorics, pp. 1449–1540. MIT Press, Cambridge (1995)

    Google Scholar 

  2. Biggs, N.: Algebraic Graph Theory. Cambridge University Press, New York (1992)

    MATH  Google Scholar 

  3. Chartrand, G., Okamoto, F., Zhang, P.: Rainbow trees in graphs and generalized connectivity. Networks 55 (4), 360–367 (2010)

    MathSciNet  MATH  Google Scholar 

  4. Li, S., Li, W., Li, X.: The generalized connectivity of complete bipartite graphs. Ars Combin. 104, 65–79 (2012)

    MathSciNet  MATH  Google Scholar 

  5. Li, S., Li, W., Li, X.: The generalized connectivity of complete equipartition 3-partite graphs. Bull. Malays. Math. Sci. Soc. (2) 37 (1), 103–121 (2014)

    Google Scholar 

  6. Li, S., Tu, J., Yu, C.: The generalized 3-connectivity of star graphs and bubble-sort graphs. Appl. Math. Comput. 274, 41–46 (2016)

    MathSciNet  Google Scholar 

  7. Li, W.: On the generalized connectivity of complete multipartite graphs, Thesis for Doctor Degree, Nankai University (2012)

    Google Scholar 

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

  9. Okamoto, F., Zhang, P.: The tree connectivity of regular complete bipartite graphs. J. Combin. Math. Combin. Comput. 74, 279–293 (2010)

    MathSciNet  MATH  Google Scholar 

  10. Palmer, E.M.: On the spanning tree packing number of a graph: a survey. Discrete Math. 230 (1-3), 13–21 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  11. Peng, Y.H., Chen, C.C., Koh, K.M.: On edge-toughness of a complete n-partite graph, Research Report No. 304, Lee Kong Chian Centre for Mathematical Reserch, National University of Singapore (1987)

    Google Scholar 

  12. Peng, Y.H., Tay, T.S.: On edge-toughness of a graph II. J. Graph Theory 17 (2), 233–246 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  13. Sun, Y., Zhou, S.: Tree connectivities of Caylay graphs on Abelian groups with small degrees. Bull. Malays. Math. Sci. Soc. (in press). DOI:10.1007/s40840-015-0147-8

    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). Results for Some Graph Classes. In: Generalized Connectivity of Graphs. SpringerBriefs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-33828-6_2

Download citation

Publish with us

Policies and ethics

Search

Navigation