✦ LIBER ✦

Discrepancy and signed domination in graphs and hypergraphs

✍ Scribed by A. Poghosyan; V. Zverovich

Book ID: 108114225
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 274 KB
Volume: 310
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2010.03.030

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

✍ Michael A. Henning 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 275 KB

Signed Roman domination in graphs

✍ Abdollahzadeh Ahangar, H.; Henning, Michael A.; LÃ¶wenstein, Christian; Zhao, Ya 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 531 KB

Efficient minus and signed domination in

Efficient minus and signed domination in graphs

✍ Chin Lung Lu; Sheng-Lung Peng; Chuan Yi Tang 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 399 KB

An e cient minus (respectively, signed) dominating function of a graph G = (V; E) is a function f : The e cient minus (respectively, signed) domination problem is to ÿnd an e cient minus (respectively, signed) dominating function of G. In this paper, we show that the e cient minus (respectively, si

On the Signed Domination in Graphs

✍ Jiří Matoušek 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 144 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