𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minus totalk-subdomination in graphs

✍ Scribed by Zhu-rong Duan; Er-fang Shan; Ming-song Li; Wei-guo Wu

Book ID
107482735
Publisher
Chinese Electronic Periodical Services
Year
2009
Tongue
English
Weight
184 KB
Volume
13
Category
Article
ISSN
1007-6417

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Minus k-subdomination in graphs II
Minus k-subdomination in graphs II
✍ Johannes H. Hattingh; Elna Ungerer πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 551 KB

Let G = (V,E) be a graph and k E Z + such that 1 ~< The k-subdomination number to {-1,0, 1} of a graph G, denoted by 7~lΒ°l(G), equals the minimum weight of a kSF of G. In this paper we give a sharp lower bound for 7~ lΒ°~ for trees and calculate 7~ ~Β°1 for an arbitrary cycle.

Lower bounds on the minus domination and
Lower bounds on the minus domination and k-subdomination numbers
✍ Liying Kang; Hong Qiao; Erfang Shan; Dingzhu Du πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 118 KB

A three-valued function f deΓΏned on the vertex set of a graph G = (V; E), f : V β†’ {-1; 0; 1} is a minus dominating function if the sum of its function values over any closed neighborhood is at least one. That is, for every consists of v and all vertices adjacent to v. The weight of a minus function

Minus domination in graphs
Minus domination in graphs
✍ Jean Dunbar; Stephen Hedetniemi; Michael A. Henning; Alice McRae πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 787 KB