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

The Double Roman Domination Numbers of Generalized Petersen Graphs P ( n , 2)

Author

Listed:
  • Huiqin Jiang

    (Key Laboratory of Pattern Recognition and Intelligent Information Processing, Institutions of Higher Education of Sichuan Province, Chengdu University, Chengdu 610106, China)

  • Pu Wu

    (Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China)

  • Zehui Shao

    (Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China)

  • Yongsheng Rao

    (Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China)

  • Jia-Bao Liu

    (School of Mathematics and Physics, Anhui Jianzhu University, Hefei 230601, China)

Abstract

A double Roman dominating function (DRDF) f on a given graph G is a mapping from V ( G ) to { 0 , 1 , 2 , 3 } in such a way that a vertex u for which f ( u ) = 0 has at least a neighbor labeled 3 or two neighbors both labeled 2 and a vertex u for which f ( u ) = 1 has at least a neighbor labeled 2 or 3. The weight of a DRDF f is the value w ( f ) = ∑ u ∈ V ( G ) f ( u ) . The minimum weight of a DRDF on a graph G is called the double Roman domination number γ d R ( G ) of G . In this paper, we determine the exact value of the double Roman domination number of the generalized Petersen graphs P ( n , 2 ) by using a discharging approach.

Suggested Citation

  • Huiqin Jiang & Pu Wu & Zehui Shao & Yongsheng Rao & Jia-Bao Liu, 2018. "The Double Roman Domination Numbers of Generalized Petersen Graphs P ( n , 2)," Mathematics, MDPI, vol. 6(10), pages 1-11, October.
    • Handle: RePEc:gam:jmathe:v:6:y:2018:i:10:p:206-:d:176046
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/6/10/206/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/6/10/206/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Zehui Shao & Jin Xu & S. M. Sheikholeslami & Shaohui Wang, 2018. "The Domination Complexity and Related Extremal Values of Large 3D Torus," Complexity, Hindawi, vol. 2018, pages 1-8, July.
    2. H. Abdollahzadeh Ahangar & J. Amjadi & S. M. Sheikholeslami & L. Volkmann & Y. Zhao, 2016. "Signed Roman edge domination numbers in graphs," Journal of Combinatorial Optimization, Springer, vol. 31(1), pages 333-346, 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. Samadi, B. & Soltankhah, N. & Abdollahzadeh Ahangar, H. & Chellali, M. & Mojdeh, D.A. & Sheikholeslami, S.M. & Valenzuela-Tripodoro, J.C., 2023. "Restrained condition on double Roman dominating functions," Applied Mathematics and Computation, Elsevier, vol. 438(C).
    2. Darja Rupnik Poklukar & Janez Žerovnik, 2023. "Double Roman Domination: A Survey," Mathematics, MDPI, vol. 11(2), pages 1-20, January.

    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. Zehui Shao & Rija Erveš & Huiqin Jiang & Aljoša Peperko & Pu Wu & Janez Žerovnik, 2021. "Double Roman Graphs in P (3 k , k )," Mathematics, MDPI, vol. 9(4), pages 1-18, February.
    2. Ansheng Ye & Fang Miao & Zehui Shao & Jia-Bao Liu & Janez Žerovnik & Polona Repolusk, 2019. "More Results on the Domination Number of Cartesian Product of Two Directed Cycles," Mathematics, MDPI, vol. 7(2), pages 1-9, February.

    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:6:y:2018:i:10:p:206-:d:176046. 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.