𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by V. Swaminathan; R. Poovazhaki

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
218 KB
Volume
15
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On point-set domination in graphs IV: Se
On point-set domination in graphs IV: Separable graphs with unique minimum psd-sets
✍ B.D. Acharya; Purnima Gupta πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 675 KB

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 in

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

Signed Domination in Regular Graphs and
Signed Domination in Regular Graphs and Set-Systems
✍ ZoltΓ‘n FΓΌredi; Dhruv Mubayi πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 188 KB

Suppose G is a graph on n vertices with minimum degree r. Using standard random methods it is shown that there exists a two-coloring of the vertices of G with colors, +1 and &1, such that all closed neighborhoods contain more 1's than &1's, and all together the number of 1's does not exceed the numb