✦ LIBER ✦

On the Mixed Minus Domination in Graphs

✍ Scribed by Xu, Baogen; Kong, Xiangyang

Book ID: 121621709
Publisher: Springer-Verlag
Year: 2013
Tongue: English
Weight: 310 KB
Volume: 1
Category: Article
ISSN: 2194-668X
DOI: 10.1007/s40305-013-0024-9

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 total domination in graphs

✍ Hua-Ming Xing; Hai-Long Liu 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 176 KB

Minus domination in regular graphs

✍ Jean Dunbar; Stephen Hedetniemi; Michael A. Henning; Alice A. McRae 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 77 KB

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

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 mixed domination problem in graph

On the mixed domination problem in graphs

✍ Lan, James K.; Chang, Gerard Jennhwa 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 437 KB