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

Nordhaus–Gaddum bounds for total Roman domination

Author

Listed:
  • J. Amjadi

    (Azarbaijan Shahid Madani University)

  • S. M. Sheikholeslami

    (Azarbaijan Shahid Madani University)

  • M. Soroudi

    (Azarbaijan Shahid Madani University)

Abstract

A Nordhaus–Gaddum-type result is a lower or an upper bound on the sum or the product of a parameter of a graph and its complement. In this paper we continue the study of Nordhaus–Gaddum bounds for the total Roman domination number $$\gamma _{tR}$$ γ t R . Let G be a graph on n vertices and let $$\overline{G}$$ G ¯ denote the complement of G, and let $$\delta ^*(G)$$ δ ∗ ( G ) denote the minimum degree among all vertices in G and $$\overline{G}$$ G ¯ . For $$\delta ^*(G)\ge 1$$ δ ∗ ( G ) ≥ 1 , we show that (i) if G and $$\overline{G}$$ G ¯ are connected, then $$(\gamma _{tR}(G)-4)(\gamma _{tR}(\overline{G})-4)\le 4\delta ^*(G)-4$$ ( γ t R ( G ) - 4 ) ( γ t R ( G ¯ ) - 4 ) ≤ 4 δ ∗ ( G ) - 4 , (ii) if $$\gamma _{tR}(G), \gamma _{tR}(\overline{G})\ge 8$$ γ t R ( G ) , γ t R ( G ¯ ) ≥ 8 , then $$\gamma _{tR}(G)+\gamma _{tR}(\overline{G})\le 2\delta ^*(G)+5$$ γ t R ( G ) + γ t R ( G ¯ ) ≤ 2 δ ∗ ( G ) + 5 and (iii) $$\gamma _{tR}(G)+\gamma _{tR}(\overline{G})\le n+5$$ γ t R ( G ) + γ t R ( G ¯ ) ≤ n + 5 and $$\gamma _{tR}(G)\gamma _{tR}(\overline{G})\le 6n-5$$ γ t R ( G ) γ t R ( G ¯ ) ≤ 6 n - 5 .

Suggested Citation

  • 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.
  • Handle: RePEc:spr:jcomop:v:35:y:2018:i:1:d:10.1007_s10878-017-0158-5
    DOI: 10.1007/s10878-017-0158-5
    as

    Download full text from publisher

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

    Citations

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


    Cited by:

    1. 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.

    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. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.

    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-0158-5. 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: 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.