A note on the independent domination number in graphs

被引：9
作者：
Rad, Nader Jafari [1 ]
Volkmann, Lutz [2 ]
机构：
[1] Shahrood Univ Technol, Dept Math, Shahrood, Iran
[2] Rhein Westfal TH Aachen, Lehrstuhl Math 2, D-52056 Aachen, Germany
来源：
DISCRETE APPLIED MATHEMATICS | 2013年 / 161卷 / 18期
关键词：
Domination; Independent;
D O I：
10.1016/j.dam.2013.07.009
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We obtain an upper bound for the independent domination number of a graph in terms of the domination number and maximum degree. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码：3087 / 3089
页数：3
相关论文
共 7 条
[1]  
Berge C., 1962, THEORY GRAPHS ITS AP
[2]  
Caro Yair, 1979, TECHNICAL REPORT
[3]  
Cockayne E. J., 1977, Networks, V7, P247, DOI 10.1002/net.3230070305
[4]  
Cockayne E.j., 1974, C NUMERANTIUM, P471
[5]   On the Independent Domination Number of Regular Graphs [J].
Goddard, Wayne ;
Henning, Michael A. ;
Lyle, Jeremy ;
Southey, Justin .
ANNALS OF COMBINATORICS, 2012, 16 (04) :719-732
[6]  
Haynes TW, 1998, Fundamentals of domination in graphs, V1st, DOI [DOI 10.1201/9781482246582, 10.1201/9781482246582]
[7]  
WEI VK, 1981, 81112179 TM BELL LAB
1