✦ LIBER ✦

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

✍ Scribed by B.D. Acharya; Purnima Gupta

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 675 KB
Volume: 195
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00160-5

No coin nor oath required. For personal study only.

✦ Synopsis

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 E D such that the induced subgraph (S U {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 psdsets. In particular, we characterize block-cactus graphs (with at least two blocks) having this property. (~

📜 SIMILAR VOLUMES

Graphs with unique minimum edge dominati

Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices

✍ Jerzy Topp 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 816 KB

Topp, J., Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices, Discrete Mathematics 12 1 (1993) 199-210. A set I of vertices of a graph G is an independent set if no two vertices of I are adjacent. A set M of edges of G is an edge dominating s

Point Set and Strong Point Set Dominatio

Point Set and Strong Point Set Domination in Graphs 1 Minimum spsd sets

✍ V. Swaminathan; R. Poovazhaki 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 218 KB