An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
复制标题
DOI：
10.1016/j.dam.2009.03.010
复制
发表时间：
2009-07
期刊：
影响因子：
--
通讯作者：
J. Hattingh;Ernst J. Joubert
中科院分区：
文献类型：
--
作者：
J. Hattingh;Ernst J. Joubert
Let G=(V,E) be a graph. A set S⊆V is a restrained dominating set if every vertex in V−S is adjacent to a vertex in S and to a vertex in V−S. The restrained domination number of G, denoted γr(G), is the smallest cardinality of a restrained dominating set of G. We will show that if G is a connected graph of order n and minimum degree δ and not isomorphic to one of nine exceptional graphs, then γr(G)≤n−δ+12.
