IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i1p65-d304487.html
   My bibliography  Save this article

The 3-Rainbow Domination Number of the Cartesian Product of Cycles

Author

Listed:
  • Hong Gao

    (College of Science, Dalian Maritime University, Dalian 116026, China)

  • Changqing Xi

    (College of Science, Dalian Maritime University, Dalian 116026, China)

  • Yuansheng Yang

    (School of Computer Science and Technology, Dalian University of Technology, Dalian 116024, China)

Abstract

We have studied the k -rainbow domination number of C n □ C m for k ≥ 4 (Gao et al. 2019), in which we present the 3-rainbow domination number of C n □ C m , which should be bounded above by the four-rainbow domination number of C n □ C m . Therefore, we give a rough bound on the 3-rainbow domination number of C n □ C m . In this paper, we focus on the 3-rainbow domination number of the Cartesian product of cycles, C n □ C m . A 3-rainbow dominating function (3RDF) f on a given graph G is a mapping from the vertex set to the power set of three colors { 1 , 2 , 3 } in such a way that every vertex that is assigned to the empty set has all three colors in its neighborhood. The weight of a 3RDF on G is the value ω ( f ) = ∑ v ∈ V ( G ) | f ( v ) | . The 3-rainbow domination number, γ r 3 ( G ) , is the minimum weight among all weights of 3RDFs on G . In this paper, we determine exact values of the 3-rainbow domination number of C 3 □ C m and C 4 □ C m and present a tighter bound on the 3-rainbow domination number of C n □ C m for n ≥ 5 .

Suggested Citation

  • Hong Gao & Changqing Xi & Yuansheng Yang, 2020. "The 3-Rainbow Domination Number of the Cartesian Product of Cycles," Mathematics, MDPI, vol. 8(1), pages 1-20, January.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:1:p:65-:d:304487
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/1/65/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/1/65/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Brezovnik, Simon & Šumenjak, Tadeja Kraner, 2019. "Complexity of k-rainbow independent domination and some results on the lexicographic product of graphs," Applied Mathematics and Computation, Elsevier, vol. 349(C), pages 214-220.
    2. Zofia Stȩpień & Lucjan Szymaszkiewicz & Maciej Zwierzchowski, 2015. "The Cartesian product of cycles with small 2-rainbow domination number," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 668-674, October.
    3. Michel Mollard, 2014. "The domination number of Cartesian product of two directed paths," Journal of Combinatorial Optimization, Springer, vol. 27(1), pages 144-151, January.
    4. Zepeng Li & Zehui Shao & Jin Xu, 2018. "Weak {2}-domination number of Cartesian products of cycles," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 75-85, January.
    5. Zepeng Li & Zehui Shao & Pu Wu & Taiyin Zhao, 2019. "On the 2-rainbow domination stable graphs," Journal of Combinatorial Optimization, Springer, vol. 37(4), pages 1327-1341, May.
    Full references (including those not matched with items on IDEAS)

    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. Hong Gao & Kun Li & Yuansheng Yang, 2019. "The k -Rainbow Domination Number of C n □ C m," Mathematics, MDPI, vol. 7(12), pages 1-19, December.
    2. Hong Gao & Penghui Wang & Enmao Liu & Yuansheng Yang, 2020. "More Results on Italian Domination in C n □ C m," Mathematics, MDPI, vol. 8(4), pages 1-10, March.
    3. Hong Gao & Changqing Xi & Kun Li & Qingfang Zhang & Yuansheng Yang, 2019. "The Italian Domination Numbers of Generalized Petersen Graphs P ( n ,3)," Mathematics, MDPI, vol. 7(8), pages 1-15, August.
    4. Zepeng Li & Zehui Shao & Jin Xu, 2018. "Weak {2}-domination number of Cartesian products of cycles," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 75-85, January.
    5. Fu-Tao Hu & Moo Young Sohn & Xue-gang Chen, 2016. "Total and paired domination numbers of $$C_m$$ C m bundles over a cycle $$C_n$$ C n," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 608-625, August.
    6. Zepeng Li & Zehui Shao & Shou-jun Xu, 2019. "2-Rainbow domination stability of graphs," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 836-845, October.
    7. Hong Gao & Tingting Feng & Yuansheng Yang, 2021. "Italian domination in the Cartesian product of paths," Journal of Combinatorial Optimization, Springer, vol. 41(2), pages 526-543, February.
    8. Ahlam Almulhim & Bana Al Subaiei & Saiful Rahman Mondal, 2024. "Survey on Roman {2}-Domination," Mathematics, MDPI, vol. 12(17), pages 1-20, September.
    9. Kijung Kim, 2020. "The Italian Domination Numbers of Some Products of Directed Cycles," Mathematics, MDPI, vol. 8(9), pages 1-6, September.

    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:gam:jmathe:v:8:y:2020:i:1:p:65-:d:304487. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.