✦ LIBER ✦

On the complexity of signed and minus total domination in graphs

✍ Scribed by Chuan-Min Lee

Book ID: 108154663
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 167 KB
Volume: 109
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2009.08.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 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

On the Signed Domination in Graphs

✍ Jiří Matoušek 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 144 KB

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

Lower bounds on the signed domination nu

Lower bounds on the signed domination numbers of directed graphs

✍ H. Karami; S.M. Sheikholeslami; Abdollah Khodkar 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 340 KB

On the Algorithmic Complexity of Total D

On the Algorithmic Complexity of Total Domination

✍ Laskar, Renu; Pfaff, John; Hedetniemi, S. M.; Hedetniemi, S. T. 📂 Article 📅 1984 🏛 Society for Industrial and Applied Mathematics ⚖ 629 KB