Skip to main content
SpringerLink
Log in

Operations on Graphs

  • Chapter
  • First Online:
Properly Colored Connectivity of Graphs

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

  • 479 Accesses

Abstract

Among the many interesting problems of determining the proper connection numbers of graphs, it is worthwhile to study the proper connection number of G according to some constraints of the complementary graph.

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

References

  1. Andrews, E., Laforge, E., Lumduanhom, C., Zhang, P.: On proper-path colorings in graphs. J. Combin. Math. Combin. Comput. 97, 189–207 (2016)

    MathSciNet  MATH  Google Scholar 

  2. Andrews, E., Laforge, E., Lumduanhom, C., Zhang, P.: Proper-path colorings in graph operations. Manuscript

    Google Scholar 

  3. Aouchiche, M., Hansen, P.: A survey of Nordhaus-Gaddum type relations. Discrete Appl. Math. 161(4–5), 466–546 (2013)

    Article  MathSciNet  Google Scholar 

  4. Bondy, J.A., Murty, U.S.R.: Graph Theory. Graduate Texts in Mathematics, vol. 244. Springer, New York (2008)

    Book  Google Scholar 

  5. Hammack, R.H., Taylor, D.T.: Proper connection of direct products. Discuss. Math. Graph Theory 37, 1005–1013 (2017)

    Article  MathSciNet  Google Scholar 

  6. Huang, F., Li, X., Wang, S.: Proper connection numbers of complementary graphs. Bull. Malays. Math. Sci. Soc. https://doi.org/10.1007/s40840-016-0381-8

  7. Laforge, E., Lumduanhom, C., Zhang, P.: Chromatic-connection in graphs. Congressus Numerantium (to appear)

    Google Scholar 

  8. Mao, Y., Yanling, F., Wang, Z., Ye, C.: Proper connection number of graph products. Bull. Malays. Math. Sci. Soc. https://doi.org/10.1007/s40840-016-0442-z

Download references

Author information

Authors and Affiliations

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

    Xueliang Li

  2. Department of Mathematics, Georgia Southern University, Statesboro, GA, USA

    Colton Magnant

  3. College of Science, Chang’an University, Xi’an, Shaanxi, China

    Zhongmei Qin

Authors
  1. Xueliang Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Colton Magnant
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhongmei Qin
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2018 The Author(s), under exclusive licence to Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Li, X., Magnant, C., Qin, Z. (2018). Operations on Graphs. In: Properly Colored Connectivity of Graphs. SpringerBriefs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-89617-5_6

Download citation

Publish with us

Policies and ethics

Search

Navigation