IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-319-94830-0_13.html
   My bibliography  Save this book chapter

Sharp Nordhaus–Gaddum-Type Lower Bounds for Proper Connection Numbers of Graphs

In: Optimization Problems in Graph Theory

Author

Listed:
  • Yuefang Sun

    (Shaoxing University)

Abstract

An edge-colored connected graph G is called properly connected if between every pair of distinct vertices, there exists a path that is properly colored. The proper connection number of a connected graph G, denoted by pc(G), is the minimum number of colors needed to color the edges of G to make it properly connected. In this work, we obtain sharp lower bounds for p c ( G ) + p c ( G ¯ ) $$pc(G)+ pc(\overline {G})$$ , and p c ( G ) p c ( G ¯ ) $$pc(G)pc(\overline {G})$$ , where G is a connected graph of order at least 8. Among our results, we also get sharp lower bounds for p v c ( G ) + p v c ( G ¯ ) $$pvc(G)+pvc(\overline {G})$$ , p v c ( G ) p v c ( G ¯ ) $$pvc(G)pvc(\overline {G})$$ , p t c ( G ) + p t c ( G ¯ ) $$ptc(G)+ptc(\overline {G})$$ and p t c ( G ) p t c ( G ¯ ) $$ptc(G)ptc(\overline {G})$$ , where pvc(G) and ptc(G) are proper vertex-connection number and proper total-connection number of G, respectively.

Suggested Citation

  • Yuefang Sun, 2018. "Sharp Nordhaus–Gaddum-Type Lower Bounds for Proper Connection Numbers of Graphs," Springer Optimization and Its Applications, in: Boris Goldengorin (ed.), Optimization Problems in Graph Theory, pages 325-331, Springer.
    • Handle: RePEc:spr:spochp:978-3-319-94830-0_13
    DOI: 10.1007/978-3-319-94830-0_13
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:spochp:978-3-319-94830-0_13. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.