✦ LIBER ✦

Minus Domination Numbers of Directed Graphs

✍ Scribed by Li, Wen Sheng; Xing, Hua Ming

Book ID: 121811914
Publisher: Trans Tech Publications, Ltd.
Year: 2011
Tongue: English
Weight: 265 KB
Volume: 267
Category: Article
ISSN: 1662-8958
DOI: 10.4028/www.scientific.net/AMR.267.334

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minus domination number in cubic graph

✍ Liying Kang; Maocheng Cai 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 260 KB

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

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

Domination numbers of planar graphs

✍ MacGillivray, G.; Seyffarth, K. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 967 KB

The problem of determining the domination number of a graph is a well known NPhard problem, even when restricted to planar graphs. By adding a further restriction on the diameter of the graph, we prove that planar graphs with diameter two and three have bounded domination numbers. This implies that