Nordhaus-Gaddum bounds for total Roman domination

被引：23
作者：
Amjadi, J. [1 ]
Sheikholeslami, S. M. [1 ]
Soroudi, M. [1 ]
机构：
[1] Azarbaijan Shahid Madani Univ, Dept Math, Tabriz, Iran
来源：
JOURNAL OF COMBINATORIAL OPTIMIZATION | 2018年 / 35卷 / 01期
关键词：
Total Roman dominating function; Total Roman domination number; Nordhaus-Gaddum inequalities; GRAPHS;
D O I：
10.1007/s10878-017-0158-5
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
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 . Let G be a graph on n vertices and let denote the complement of G, and let denote the minimum degree among all vertices in G and . For , we show that (i) if G and are connected, then , (ii) if , then and (iii) and .
引用
收藏
页码：126 / 133
页数：8
相关论文
共 14 条
  • [1] TOTAL ROMAN DOMINATION IN GRAPHS
    Ahangar, Hossein Abdollahzadeh
    Henning, Michael A.
    Samodivkin, Vladimir
    Yero, Ismael G.
    [J]. APPLICABLE ANALYSIS AND DISCRETE MATHEMATICS, 2016, 10 (02) : 501 - 517
  • [2] Amjadi J, 2017, DISCRET MATH ALGORIT, V9, DOI 10.1142/S1793830917500501
  • [3] EXTREMAL PROBLEMS FOR ROMAN DOMINATION
    Chambers, Erin W.
    Kinnersley, Bill
    Prince, Noah
    West, Douglas B.
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2009, 23 (03) : 1575 - 1586
  • [4] Roman domination in graphs
    Cockayne, EJ
    Dreyer, PA
    Hedetniemi, SM
    Hedetniemi, ST
    [J]. DISCRETE MATHEMATICS, 2004, 278 (1-3) : 11 - 22
  • [5] On the Roman domination number of a graph
    Favaron, O.
    Karami, H.
    Khoeilar, R.
    Sheikholeslami, S. M.
    [J]. DISCRETE MATHEMATICS, 2009, 309 (10) : 3447 - 3451
  • [6] Haynes TW, 1998, Fundamentals of domination in graphs, V1st, DOI [DOI 10.1201/9781482246582, 10.1201/9781482246582]
  • [7] Haynes TW., 1998, FUNDAMENTALS DOMINAT
  • [8] Henning M. A., 2013, SPRINGER MONOGRAPHS
  • [9] Connected Domination Number of a Graph and its Complement
    Karami, H.
    Sheikholeslami, S. M.
    Khodkar, Abdollah
    West, Douglas B.
    [J]. GRAPHS AND COMBINATORICS, 2012, 28 (01) : 123 - 131
  • [10] Roman domination on strongly chordal graphs
    Liu, Chun-Hung
    Chang, Gerard J.
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 26 (03) : 608 - 619
12