𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On restricted domination in graphs

✍ Scribed by Vladimir Samodivkin

Book ID
111492916
Publisher
SP Versita
Year
2007
Tongue
English
Weight
133 KB
Volume
57
Category
Article
ISSN
0139-9918

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On -total domination in graphs
On -total domination in graphs
✍ Michael A. Henning; Nader Jafari Rad πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 244 KB
On majority domination in graphs
On majority domination in graphs
✍ Tara S. Holm πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 106 KB
On the Signed Domination in Graphs
On the Signed Domination in Graphs
✍ JiΕ™Γ­ MatouΕ‘ek πŸ“‚ Article πŸ“… 2000 πŸ› Springer-Verlag 🌐 English βš– 144 KB
On weakly connected domination in graphs
On weakly connected domination in graphs
✍ Jean E. Dunbar; Jerrold W. Grossman; Johannes H. Hattingh; Stephen T. Hedetniemi πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 497 KB

A weakly connected dominating set for a connected graph is a dominating set D of vertices of the graph such that the edges not incident to any vertex in D do not separate the graph. This paper considers the weakly connected domination number, 7w, and related domination parameters. It is shown that t