๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On weighted efficient total domination

โœ Scribed by Oliver Schaudt

Book ID
113699048
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
201 KB
Volume
10
Category
Article
ISSN
1570-8667

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Solving the weighted efficient edge domi
Solving the weighted efficient edge domination problem on bipartite permutation graphs
โœ Chin Lung Lu; Chuan Yi Tang ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 666 KB

Given a simple graph G = (V, E), an edge (u, u) E E is said to dominate itself and any edge (u,x) or (u,x), where x E V. A subset D C E is called an efficient edge dominating set of G if all edges in E are dominated by exactly one edge of D. The efficient edge domination problem is to find an effici

On -total domination in graphs
On -total domination in graphs
โœ Michael A. Henning; Nader Jafari Rad ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 244 KB
A note on total domination
A note on total domination
โœ Robert B Allan; Renu Laskar; Stephen Hedetniemi ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 278 KB

For a graph G, let ~'(G), 3,z(G), i(G) and ir(G) denote the domination, total domination, independent domination and irredundance numbers of G, respectively. The following conjectures due to Robyn Dawes are proved: G)<~p and (ii) i(G)+ ~/z(G)~2. It is also shown that (iii) 3,t(G) ~<2ir(G) and (iv) 3