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

Total domination in block graphs

โœ Scribed by Gerard J Chang

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
382 KB
Volume
8
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Total domination in graphs
Total domination in graphs
โœ E. J. Cockayne; R. M. Dawes; S. T. Hedetniemi ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 374 KB
R-domination on block graphs
R-domination on block graphs
โœ Gerard J Chang; George L Nemhauser ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 450 KB
Upper total domination in claw-free grap
Upper total domination in claw-free graphs
โœ Odile Favaron; Michael A. Henning ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 114 KB

## 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__ (other than itself). The maximum cardinality of a minimal total dominating set of __G__ is the upper total domination number of __G__, denoted by ฮ“~__

Graphs with large total domination numbe
Graphs with large total domination number
โœ Michael A. Henning ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 246 KB ๐Ÿ‘ 1 views
Total domination in graphs with minimum
Total domination in graphs with minimum degree three
โœ Favaron, Odile; Henning, Michael A.; Mynhart, Christina M.; Puech, Jo๏ฟฝl ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 132 KB ๐Ÿ‘ 3 views

A set S of vertices of a graph G is a total dominating set, if every vertex of V (G) is adjacent to some vertex in S. The total domination number of G, denoted by ฮณ t (G), is the minimum cardinality of a total dominating set of G. We prove that, if G is a graph of order n with minimum degree at leas