SET DOMINATION IN GRAPHS

被引：6

作者：

SAMPATHKUMAR, E

LATHA, LP

机构：

[1] Department of Mathematics, University of Mysore, Mysore

来源：

JOURNAL OF GRAPH THEORY | 1994年 / 18卷 / 05期

关键词：

D O I：

10.1002/jgt.3190180507

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let G = (V, E) be a connected graph. A set D subset-of V is a set-dominating set (sd-set) if for every set T subset-of V - D, there exists a nonempty set S subset-of D such that the subgraph [S or T] induced by S or T is connected. The set-domination number gamma(s)(G) of G is the minimum cardinality of a sd-set. In this paper we develop properties of this new parameter and relate it to some other known domination parameters. (C) 1994 John Wiley & Sons, Inc.

引用

页码：489 / 495

页数：7