✦ LIBER ✦

Lower bounds on the signed domination numbers of directed graphs

✍ Scribed by H. Karami; S.M. Sheikholeslami; Abdollah Khodkar

Book ID: 108114022
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 340 KB
Volume: 309
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.04.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound on the total signed domina

A lower bound on the total signed domination numbers of graphs

✍ Xin-zhong Lu 📂 Article 📅 2007 🏛 SP Science China Press 🌐 English ⚖ 172 KB

A note on the lower bounds of signed dom

A note on the lower bounds of signed domination number of a graph

✍ Zhongfu Zhang; Baogen Xu; Yinzhen Li; Linzhong Liu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 159 KB

Bounds on the signed domination number o

Bounds on the signed domination number of a graph

✍ Ruth Haas; Thomas B. Wexler 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 387 KB

Lower bounds on several versions of sign

Lower bounds on several versions of signed domination number

✍ Weidong Chen; Enmin Song 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 174 KB

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

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