✦ LIBER ✦

The algorithmic complexity of minus domination in graphs

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

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 796 KB
Volume: 68
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(95)00056-w

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

Minus domination in regular graphs

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

The complexity of domination problems in

The complexity of domination problems in circle graphs

✍ J.Mark Keil 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 854 KB

The difference between the domination nu

The difference between the domination number and the minus domination number of a cubic graph

✍ Xiaofan Yang; Qibin Hou; Xiangsheng Huang; Hengnong Xuan 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 325 KB

The closed neighborhood of a vertex subset S of a graph G = (V,E), denoted as N[Sj, is defined ss the union of S and the set of all the vertices adjacent to some vertex of S. A dominating set of a graph G = (V, E) is defined as a set S of vertices such that N[q = V. The domination number of a graph

Parallel algorithms for the domination p

Parallel algorithms for the domination problems in trapezoid graphs

✍ Y.Daniel Liang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 608 KB

Trapezoid graphs are a superclass of permutation graphs and interval graphs. This paper presents first parallel algorithms for the independent domination, total domination, connected domination and domination problems in weighted trapezoid graphs. All these algorithms take O(log'n) time on a EREW PR