IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v34y2017i1d10.1007_s10878-016-0052-6.html
   My bibliography  Save this article

Rainbow connection numbers of Cayley graphs

Author

Listed:
  • Yingbin Ma

    (Henan Normal University
    Nankai University)

  • Zaiping Lu

    (Nankai University)

Abstract

An edge colored graph is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number, rc-number for short, of a graph $${\varGamma }$$ Γ , is the smallest number of colors that are needed in order to make $${\varGamma }$$ Γ rainbow connected. In this paper, we give a method to bound the rc-numbers of graphs with certain structural properties. Using this method, we investigate the rc-numbers of Cayley graphs, especially, those defined on abelian groups and on dihedral groups.

Suggested Citation

  • Yingbin Ma & Zaiping Lu, 2017. "Rainbow connection numbers of Cayley graphs," Journal of Combinatorial Optimization, Springer, vol. 34(1), pages 182-193, July.
  • Handle: RePEc:spr:jcomop:v:34:y:2017:i:1:d:10.1007_s10878-016-0052-6
    DOI: 10.1007/s10878-016-0052-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-016-0052-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-016-0052-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sourav Chakraborty & Eldar Fischer & Arie Matsliah & Raphael Yuster, 2011. "Hardness and algorithms for rainbow connection," Journal of Combinatorial Optimization, Springer, vol. 21(3), pages 330-347, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Fu-Hsing Wang & Cheng-Ju Hsu, 2024. "Rainbow Connection Numbers of WK-Recursive Networks and WK-Recursive Pyramids," Mathematics, MDPI, vol. 12(7), pages 1-11, March.
    2. Nie, Kairui & Ma, Yingbin & Sidorowicz, Elżbieta, 2023. "(Strong) Proper vertex connection of some digraphs," Applied Mathematics and Computation, Elsevier, vol. 458(C).
    3. Ma, Yingbin & Zhang, Xiaoxue, 2023. "Graphs with (strong) proper connection numbers m−3 and m−4," Applied Mathematics and Computation, Elsevier, vol. 445(C).
    4. Ma, Yingbin & Zhu, Wenhan, 2022. "Some results on the 3‐total‐rainbow index," Applied Mathematics and Computation, Elsevier, vol. 427(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Qingqiong Cai & Xueliang Li & Yan Zhao, 2016. "The 3-rainbow index and connected dominating sets," Journal of Combinatorial Optimization, Springer, vol. 31(3), pages 1142-1159, April.
    2. Fu-Hsing Wang & Cheng-Ju Hsu, 2024. "Rainbow Connection Numbers of WK-Recursive Networks and WK-Recursive Pyramids," Mathematics, MDPI, vol. 12(7), pages 1-11, March.

    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:jcomop:v:34:y:2017:i:1:d:10.1007_s10878-016-0052-6. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.