On point-set domination in graphs IV: Separable graphs with unique minimum psd-sets

被引：8

作者：

Acharya, BD

Gupta, P

机构：

[1] Govt India, Dept Sci & Technol, New Delhi 110016, India

[2] Sri Venkateswara Univ, Dept Math, New Delhi 110021, India

来源：

DISCRETE MATHEMATICS | 1999年 / 195卷 / 1-3期

关键词：

point-set domination; separable graphs; unique minimum psd-set; block-cactus graph; stringed r-cycle;

D O I：

10.1016/S0012-365X(98)00160-5

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A set D of vertices in a graph G = (V,E) is called a point-set dominating (or, psd-) set of G if for every nonempty subset S of V - D there exists v is an element of D such that the induced subgraph [S boolean OR {v}] is connected (cf. Sampthkumar and Pushpa Latha (1993) [6]). Here, we report results of our investigation into the nature of connected separable graphs having unique minimum psd-sets. In particular, we characterize block-cactus graphs (with at least two blocks) having this property. (C) 1999 Elsevier Science B.V. All rights reserved.

引用

页码：1 / 13

页数：13