✦ LIBER ✦

Total domination in complements of graphs containing no K4,4

✍ Scribed by Shannon Fitzpatrick; Gary MacGillivray; Devon McCrea

Book ID: 108315715
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 110 KB
Volume: 254
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00369-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithmic aspects of k-tuple total dom

Algorithmic aspects of k-tuple total domination in graphs

✍ D. Pradhan 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 228 KB

k-tuple total domination in cross produc

k-tuple total domination in cross products of graphs

✍ Michael A. Henning, Adel P. Kazemi 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 343 KB

[Springer Monographs in Mathematics] Tot

[Springer Monographs in Mathematics] Total Domination in Graphs || Variations of Total Domination

✍ Henning, Michael A.; Yeo, Anders 📂 Article 📅 2013 🏛 Springer New York ⚖ 163 KB

Total domination in 2-connected graphs a

Total domination in 2-connected graphs and in graphs with no induced 6-cycles

✍ Michael A. Henning; Anders Yeo 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 272 KB 👁 1 views

## Abstract A set __S__ of vertices in a graph __G__ is a total dominating set of __G__ if every vertex of __G__ is adjacent to some vertex in __S__. The minimum cardinality of a total dominating set of __G__ is the total domination number γ~t~(__G__) of __G__. It is known [J Graph Theory 35 (2000)

Proof of Toft's Conjecture: Every Graph

Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4is 3-Colorable

✍ Wenan Zang 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 542 KB

The total domination subdivision number

The total domination subdivision number in graphs with no induced 3-cycle and 5-cycle

✍ H. Karami, R. Khoeilar, S. M. Sheikholeslami 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 329 KB