𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Real and integer domination in graphs

✍ Scribed by Wayne Goddard; Michael A. Henning

Book ID
108316294
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
974 KB
Volume
199
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Graph products and integer domination
Graph products and integer domination
✍ Niluk John; Stephen Suen πŸ“‚ Article πŸ“… 2013 πŸ› Elsevier Science 🌐 English βš– 242 KB
Generalized domination and efficient dom
Generalized domination and efficient domination in graphs
✍ D.W. Bange; A.E. Barkauskas; L.H. Host; P.J. Slater πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 516 KB

This paper generalizes dominating and efficient dominating sets of a graph. Let G be a graph with vertex set V(G). If f: V(G) ~ Y, where Y is a subset of the reals, the weight off is the sum of f(v) over all ve V(G). If the closed neighborhood sum off(v) at every vertex is at least 1, thenfis called

Paired-domination in graphs
Paired-domination in graphs
✍ Haynes, Teresa W.; Slater, Peter J. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 145 KB πŸ‘ 3 views

In a graph G Γ… (V, E) if we think of each vertex s as the possible location for a guard capable of protecting each vertex in its closed neighborhood N[s], then ''domination'' requires every vertex to be protected. Thus, S ʚ V (G) is a dominating set if ʜ s √ S N[s] Γ… V (G). For total domination, eac

Set domination in graphs
Set domination in graphs
✍ E. Sampathkumar; L. Pushpa Latha πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 355 KB

## Abstract Let __G__ = (__V, E__) be a connected graph. A set __D__ βŠ‚ __V__ is a __set‐dominating set__ (sd‐set) if for every set __T__ βŠ‚ __V__ βˆ’ __D__, there exists a nonempty set __S__ βŠ‚ __D__ such that the subgraph γ€ˆ__S__ βˆͺ __T__〉 induced by __S__ βˆͺ __T__ is connected. The set‐domination number