๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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

โœ Scribed by H. Karami, R. Khoeilar, S. M. Sheikholeslami

Book ID
118802003
Publisher
Springer US
Year
2011
Tongue
English
Weight
329 KB
Volume
25
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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)