𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Signed total domination in nearly regular graphs

✍ Scribed by Li-ying Kang; Er-fang Shan

Book ID
107482407
Publisher
Chinese Electronic Periodical Services
Year
2006
Tongue
English
Weight
316 KB
Volume
10
Category
Article
ISSN
1007-6417

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Signed domination in regular graphs
Signed domination in regular graphs
✍ Odile Favaron πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 456 KB

In answer to the open questions proposed by Henning and Slater, we give sharp upper bounds on the upper signed domination number of a regular graph and on the signed domination number of a connected cubic graph. Let G = (V, E) be a simple graph. For v E V, we denote by d(u) the degree of v in V, by

Signed total domination in graphs
Signed total domination in graphs
✍ Michael A. Henning πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 275 KB
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

Signed Roman domination in graphs
Signed Roman domination in graphs
✍ Abdollahzadeh Ahangar, H.; Henning, Michael A.; Lâwenstein, Christian; Zhao, Ya πŸ“‚ Article πŸ“… 2012 πŸ› Springer US 🌐 English βš– 531 KB
On the Signed Domination in Graphs
On the Signed Domination in Graphs
✍ JiΕ™Γ­ MatouΕ‘ek πŸ“‚ Article πŸ“… 2000 πŸ› Springer-Verlag 🌐 English βš– 144 KB