𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for prescribed multiple domination in arbitrary graphs

✍ Scribed by M. Satratzemi; K.G. Margaritis; C. Tsouros

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
384 KB
Volume
35
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Parallel algorithms for the domination p
Parallel algorithms for the domination problems in trapezoid graphs
✍ Y.Daniel Liang πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 608 KB

Trapezoid graphs are a superclass of permutation graphs and interval graphs. This paper presents first parallel algorithms for the independent domination, total domination, connected domination and domination problems in weighted trapezoid graphs. All these algorithms take O(log'n) time on a EREW PR

On equality in an upper bound for domina
On equality in an upper bound for domination parameters of graphs
✍ Favaron, O.; Mynhardt, C. M. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 141 KB πŸ‘ 2 views

We consider the well-known upper bounds Β΅(G) ≀ |V (G)|-βˆ†(G), where βˆ†(G) denotes the maximum degree of G and Β΅(G) the irredundance, domination or independent domination numbers of G and give necessary and sufficient conditions for equality to hold in each case. We also describe specific classes of gr