✦ LIBER ✦

Minus domination in regular graphs

✍ Scribed by Jean Dunbar; Stephen Hedetniemi; Michael A. Henning; Alice A. McRae

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 77 KB
Volume: 149
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00329-h

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minus domination in graphs

✍ Jean Dunbar; Stephen Hedetniemi; Michael A. Henning; Alice McRae 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 787 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

Independent domination in regular graphs

✍ Julie Haviland 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 387 KB

Let G be a simple graph of order n. The independent domination number i(G) is defined to be the minimum cardinality among all maximal independent sets of vertices of G. Motivated by work of Cockayne et al. (1991) and Cockayne and Mynhardt (1989), we investigate the maximum value of the product of th

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

The algorithmic complexity of minus domi

The algorithmic complexity of minus domination in graphs

✍ Jean Dunbar; Wayne Goddard; Stephen Hedetniemi; Alice McRae; Michael A. Henning 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 796 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