✦ LIBER ✦

On -total domination in graphs

✍ Scribed by Michael A. Henning; Nader Jafari Rad

Book ID: 113564742
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 244 KB
Volume: 160
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.11.021

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the total domination subdivision numb

On the total domination subdivision numbers in graphs

✍ Seyed Mahmoud Sheikholeslami 📂 Article 📅 2010 🏛 SP Versita 🌐 English ⚖ 335 KB

On total traffic domination in non-compl

On total traffic domination in non-complete graphs

✍ Pablo Pavón Mariño; Michał Pióro 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 235 KB

Given an undirected graph G(V , E), a set of traffic matrices H and one additional traffic matrix h, we say that H totally dominates h if, for each capacity reservation u supporting H , u also supports h using the same routing pattern. It has been shown that if |H| = 1 (H = { ĥ}, say) and G is a com

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

On the total domination subdivision numb

On the total domination subdivision number in some classes of graphs

✍ O. Favaron; H. Karami; R. Khoeilar; S. M. Sheikholeslami 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 302 KB

An Improved Upper Bound on the Total Res

An Improved Upper Bound on the Total Restrained Domination Number in Cubic Graphs

✍ Justin Southey, Michael A. Henning 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 203 KB

Total domination in graphs

✍ E. J. Cockayne; R. M. Dawes; S. T. Hedetniemi 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 374 KB