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

Dominating the Direct Product of Two Graphs through Total Roman Strategies

Author

Listed:
  • Abel Cabrera Martínez

    (Departament d’Enginyeria Informàtica i Matemàtiques, Universitat Rovira i Virgili, 43007 Tarragona, Spain)

  • Dorota Kuziak

    (Departamento de Estadística e Investigación Operativa, Universidad de Cádiz, 11202 Algeciras, Spain)

  • Iztok Peterin

    (Faculty of Electrical Engineering and Computer Science, University of Maribor, 2000 Maribor, Slovenia
    Institute of Mathematics, Physics and Mechanics, SI-1000 Ljubljana, Slovenia)

  • Ismael G. Yero

    (Departamento de Matemáticas, Universidad de Cádiz, 11202 Algeciras, Spain)

Abstract

Given a graph G without isolated vertices, a total Roman dominating function for G is a function f : V ( G ) → { 0 , 1 , 2 } such that every vertex u with f ( u ) = 0 is adjacent to a vertex v with f ( v ) = 2 , and the set of vertices with positive labels induces a graph of minimum degree at least one. The total Roman domination number γ t R ( G ) of G is the smallest possible value of ∑ v ∈ V ( G ) f ( v ) among all total Roman dominating functions f . The total Roman domination number of the direct product G × H of the graphs G and H is studied in this work. Specifically, several relationships, in the shape of upper and lower bounds, between γ t R ( G × H ) and some classical domination parameters for the factors are given. Characterizations of the direct product graphs G × H achieving small values ( ≤ 7 ) for γ t R ( G × H ) are presented, and exact values for γ t R ( G × H ) are deduced, while considering various specific direct product classes.

Suggested Citation

  • Abel Cabrera Martínez & Dorota Kuziak & Iztok Peterin & Ismael G. Yero, 2020. "Dominating the Direct Product of Two Graphs through Total Roman Strategies," Mathematics, MDPI, vol. 8(9), pages 1-13, August.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:9:p:1438-:d:404911
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Chun-Hung Liu & Gerard J. Chang, 2013. "Roman domination on strongly chordal graphs," Journal of Combinatorial Optimization, Springer, vol. 26(3), pages 608-619, October.
    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. Tian Liu & Chaoyi Wang & Ke Xu, 2015. "Large hypertree width for sparse random hypergraphs," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 531-540, April.
    2. J. Amjadi & S. M. Sheikholeslami & M. Soroudi, 2018. "Nordhaus–Gaddum bounds for total Roman domination," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 126-133, January.
    3. Abel Cabrera Martínez & Suitberto Cabrera García & Andrés Carrión García & Frank A. Hernández Mira, 2020. "Total Roman Domination Number of Rooted Product Graphs," Mathematics, MDPI, vol. 8(10), pages 1-13, October.
    4. Cai-Xia Wang & Yu Yang & Hong-Juan Wang & Shou-Jun Xu, 2021. "Roman {k}-domination in trees and complexity results for some classes of graphs," Journal of Combinatorial Optimization, Springer, vol. 42(1), pages 174-186, July.
    5. Abolfazl Poureidi & Nader Jafari Rad, 2020. "Algorithmic and complexity aspects of problems related to total Roman domination for graphs," Journal of Combinatorial Optimization, Springer, vol. 39(3), pages 747-763, April.
    6. Abel Cabrera Martínez & Juan C. Hernández-Gómez & José M. Sigarreta, 2021. "On the Quasi-Total Roman Domination Number of Graphs," Mathematics, MDPI, vol. 9(21), pages 1-11, November.
    7. Abel Cabrera Martínez & Suitberto Cabrera García & Andrés Carrión García, 2020. "Further Results on the Total Roman Domination in Graphs," Mathematics, MDPI, vol. 8(3), pages 1-8, 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:gam:jmathe:v:8:y:2020:i:9:p:1438-:d:404911. 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.