✦ LIBER ✦

Signed total domination in graphs

✍ Scribed by Michael A. Henning

Book ID: 108113381
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 275 KB
Volume: 278
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2003.06.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Signed total domination in nearly regula

Signed total domination in nearly regular graphs

✍ Li-ying Kang; Er-fang Shan 📂 Article 📅 2006 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 316 KB

On the complexity of signed and minus to

On the complexity of signed and minus total domination in graphs

✍ Chuan-Min Lee 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 167 KB

[Communications in Computer and Informat

[Communications in Computer and Information Science] Information Computing and Applications Volume 308 || Inverse Signed Total Domination Numbers of Some Kinds of Graphs

✍ Liu, Chunfeng; Wang, Leizhen; Yang, Aimin 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 202 KB

This two-volume set of CCIS 307 and CCIS 308 constitutes the refereed proceedings of the Third International Conference on Information Computing and Applications, ICICA 2012, held in Chengde, China, in September 2012. The 330 revised full papers presented in both volumes were carefully reviewed and

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

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

On the Signed Domination in Graphs

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