𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower bounds on several versions of signed domination number

✍ Scribed by Weidong Chen; Enmin Song

Book ID
108113741
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
174 KB
Volume
308
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bounds on the -domination number of a gr
Bounds on the -domination number of a graph
✍ Ermelinda DeLaViΓ±a; Wayne Goddard; Michael A. Henning; Ryan Pepper; Emil R. Vaug πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 200 KB

The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove two bounds on the k-domination number of a graph, inspired by two conjectures of the computer program Graffiti.pc. In part

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