IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v382y2020ics0096300320303076.html
   My bibliography  Save this article

Rainbow domination numbers of generalized Petersen graphs

Author

Listed:
  • Gao, Zhipeng
  • Lei, Hui
  • Wang, Kui

Abstract

Domination and its variations in graphs are natural models for the location problems in operations research. In this paper, we investigate the rainbow domination number of graphs, which was introduced by Brešar, Henning and Rall. Given a graph G and a positive integer t, a t-rainbow dominating function of G is a function f from vertex set to the set of all subsets of {1, 2, ⋅⋅⋅, t} such that for any vertex v with f(v)=ϕ, we have ⋃u∈N(v)f(u)={1,2,⋯,t}. The t-rainbow domination problem is to determine the t-rainbow domination number γrt(G) of G, that is the minimum value of ∑v ∈ V(G)|f(v)|, where f runs over all t-rainbow dominating functions of G. The domination number and its variations of generalized Petersen graphs P(n, k) are widely investigated. The exact values of γr2(P(n, 1)) and γr3(P(n, 1)) are already determined in [11, 12]. In this paper, we determine the exact values of γrt(P(n, 1)) for any t ≥ 8 and t=4 and prove that γrt(P(2k,k))=4k for t ≥ 6, where P(2k, k) is a special graph.

Suggested Citation

  • Gao, Zhipeng & Lei, Hui & Wang, Kui, 2020. "Rainbow domination numbers of generalized Petersen graphs," Applied Mathematics and Computation, Elsevier, vol. 382(C).
    • Handle: RePEc:eee:apmaco:v:382:y:2020:i:c:s0096300320303076
    DOI: 10.1016/j.amc.2020.125341
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300320303076
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2020.125341?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. Chen, Lily & Ma, Yingbin & Shi, Yongtang & Zhao, Yan, 2018. "On the [1,2]-domination number of generalized Petersen graphs," Applied Mathematics and Computation, Elsevier, vol. 327(C), pages 1-7.
    2. Yongtang Shi & Meiqin Wei & Jun Yue & Yan Zhao, 2017. "Coupon coloring of some special graphs," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 156-164, January.
    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. Simon Brezovnik & Darja Rupnik Poklukar & Janez Žerovnik, 2023. "On 2-Rainbow Domination of Generalized Petersen Graphs P ( ck , k )," Mathematics, MDPI, vol. 11(10), pages 1-16, May.

    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. Ma, Yuede & Cai, Qingqiong & Yao, Shunyu, 2019. "Integer linear programming models for the weighted total domination problem," Applied Mathematics and Computation, Elsevier, vol. 358(C), pages 146-150.
    2. Yue, Jun & Wei, Meiqin & Li, Min & Liu, Guodong, 2018. "On the double Roman domination of graphs," Applied Mathematics and Computation, Elsevier, vol. 338(C), pages 669-675.
    3. 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.
    4. Banerjee, S. & Henning, Michael A. & Pradhan, D., 2021. "Perfect Italian domination in cographs," Applied Mathematics and Computation, Elsevier, vol. 391(C).
    5. Chen, He & Jin, Zemin, 2017. "Coupon coloring of cographs," Applied Mathematics and Computation, Elsevier, vol. 308(C), pages 90-95.
    6. Bermudo, Sergio & Higuita, Robinson A. & Rada, Juan, 2020. "Domination in hexagonal chains," Applied Mathematics and Computation, Elsevier, vol. 369(C).

    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:eee:apmaco:v:382:y:2020:i:c:s0096300320303076. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.