𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Steiner set and connected domination in trapezoid graphs

✍ Scribed by Y.Daniel Liang

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
710 KB
Volume
56
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Permutation graphs: Connected domination
Permutation graphs: Connected domination and Steiner trees
✍ Charles J. Colbourn; Lorna K. Stewart πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 702 KB

Efficient algorithms are developed for finding a minimum cardinality connected dominating set and a minimum cardinality Steiner tree in permutation graphs. This contrasts with the known NP-completeness of both problems on comparability graphs in general.

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

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