𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parameterized edge dominating set in graphs with degree bounded by 3

✍ Scribed by Xiao, Mingyu; Nagamochi, Hiroshi

Book ID
123062090
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
405 KB
Volume
508
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bounds related to domination in graphs w
Bounds related to domination in graphs with minimum degree two
✍ Sanchis, Laura A. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 157 KB πŸ‘ 2 views

A dominating set for a graph G = (V, E) is a subset of vertices V βŠ† V such that for all v ∈ V -V there exists some u ∈ V for which {v, u} ∈ E. The domination number of G is the size of its smallest dominating set(s). We show that for almost all connected graphs with minimum degree at least 2 and q e