GRAPHS WITH EQUAL DOMINATION AND INDEPENDENT DOMINATION NUMBER

被引:0
|
作者
Vaidya, S. K. [1 ]
Pandit, R. M. [2 ]
机构
[1] Saurashtra Univ, Dept Math, Rajkot 360005, Gujarat, India
[2] AV Parekh Tech Inst, Dept Math, Rajkot 360001, Gujarat, India
关键词
Dominating set; domination number; independent dominating set; independent domination number;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
A set S of vertices of a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. The independent domination number of G, denoted by i(G), is the minimum cardinality of an independent dominating set of G. In this paper, some new classes of graphs with equal domination and independent domination numbers are presented and exact values of their domination and independent domination numbers are determined.
引用
收藏
页码:74 / 79
页数:6
相关论文
共 50 条