✦ LIBER ✦

Signed Roman domination in digraphs

✍ Scribed by Sheikholeslami, S. M.; Volkmann, L.

Book ID: 120683121
Publisher: Springer US
Year: 2013
Tongue: English
Weight: 189 KB
Volume: 30
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-013-9648-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Signed Roman domination in graphs

✍ Abdollahzadeh Ahangar, H.; Henning, Michael A.; LÃ¶wenstein, Christian; Zhao, Ya 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 531 KB

Signed Roman edge domination numbers in

Signed Roman edge domination numbers in graphs

✍ Ahangar, H. Abdollahzadeh; Amjadi, J.; Sheikholeslami, S. M.; Volkmann, L.; Zhao 📂 Article 📅 2014 🏛 Springer US 🌐 English ⚖ 209 KB

Signed 2-independence in digraphs

✍ Lutz Volkmann 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 204 KB

Efficient total domination in digraphs

✍ Schaudt, Oliver 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 232 KB

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

Signed total domination in graphs

✍ Michael A. Henning 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 275 KB