IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v35y2018i1d10.1007_s10878-017-0156-7.html
   My bibliography  Save this article

Rainbow vertex connection of digraphs

Author

Listed:
  • Hui Lei

    (Nankai University)

  • Shasha Li

    (Zhejiang University)

  • Henry Liu

    (Central South University)

  • Yongtang Shi

    (Nankai University)

Abstract

An edge-coloured path is rainbow if its edges have distinct colours. An edge-coloured connected graph is said to be rainbow connected if any two vertices are connected by a rainbow path, and strongly rainbow connected if any two vertices are connected by a rainbow geodesic. The (strong) rainbow connection number of a connected graph is the minimum number of colours needed to make the graph (strongly) rainbow connected. These two graph parameters were introduced by Chartrand et al. (Math Bohem 133:85–98, 2008). As an extension, Krivelevich and Yuster proposed the concept of rainbow vertex-connection. The topic of rainbow connection in graphs drew much attention and various similar parameters were introduced, mostly dealing with undirected graphs. Dorbec, Schiermeyer, Sidorowicz and Sopena extended the concept of the rainbow connection to digraphs. In this paper, we consider the (strong) rainbow vertex-connection number of digraphs. Results on the (strong) rainbow vertex-connection number of biorientations of graphs, cycle digraphs, circulant digraphs and tournaments are presented.

Suggested Citation

  • Hui Lei & Shasha Li & Henry Liu & Yongtang Shi, 2018. "Rainbow vertex connection of digraphs," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 86-107, January.
    • Handle: RePEc:spr:jcomop:v:35:y:2018:i:1:d:10.1007_s10878-017-0156-7
    DOI: 10.1007/s10878-017-0156-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-017-0156-7
    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-017-0156-7?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.

    Citations

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


    Cited by:

    1. Ma, Yingbin & Zhang, Xiaoxue, 2023. "Graphs with (strong) proper connection numbers m−3 and m−4," Applied Mathematics and Computation, Elsevier, vol. 445(C).
    2. Ma, Yingbin & Zhu, Wenhan, 2022. "Some results on the 3‐total‐rainbow index," Applied Mathematics and Computation, Elsevier, vol. 427(C).
    3. Guan, Xiaxia & Xue, Lina & Cheng, Eddie & Yang, Weihua, 2019. "Minimum degree and size conditions for the proper connection number of graphs," Applied Mathematics and Computation, Elsevier, vol. 352(C), pages 205-210.
    4. Li, Shasha & Zhao, Yan & Li, Fengwei & Gu, Ruijuan, 2019. "The generalized 3-connectivity of the Mycielskian of a graph," Applied Mathematics and Computation, Elsevier, vol. 347(C), pages 882-890.
    5. Ma, Yingbin & Nie, Kairui & Jin, Fengxia & Wang, Cui, 2019. "Total rainbow connection numbers of some special graphs," Applied Mathematics and Computation, Elsevier, vol. 360(C), pages 213-220.
    6. Nie, Kairui & Ma, Yingbin & Sidorowicz, Elżbieta, 2023. "(Strong) Proper vertex connection of some digraphs," Applied Mathematics and Computation, Elsevier, vol. 458(C).
    7. Gu, Ran & Deng, Bo & Li, Rui, 2019. "Note on directed proper connection number of a random graph," Applied Mathematics and Computation, Elsevier, vol. 361(C), pages 169-174.
    8. Fiedorowicz, Anna & Sidorowicz, Elżbieta & Sopena, Éric, 2021. "Proper connection and proper-walk connection of digraphs," Applied Mathematics and Computation, Elsevier, vol. 410(C).
    9. Yingbin Ma & Kairui Nie, 2021. "(Strong) Total proper connection of some digraphs," Journal of Combinatorial Optimization, Springer, vol. 42(1), pages 24-39, July.

    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:35:y:2018:i:1:d:10.1007_s10878-017-0156-7. 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.