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

On the algorithmic complexity of -tuple total domination

โœ Scribed by Lan, James K.; Chang, Gerard Jennhwa


Book ID
122273600
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
482 KB
Volume
174
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On the Algorithmic Complexity of Total D
โœ Laskar, Renu; Pfaff, John; Hedetniemi, S. M.; Hedetniemi, S. T. ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Society for Industrial and Applied Mathematics โš– 629 KB
On the computational complexity of upper
โœ Qizhi Fang ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 359 KB

Let G = (V; E) be an undirected graph. Upper total domination number t (G) is the maximum cardinality over all minimal total dominating sets of G, and upper fractional total domination number t (G) is the maximum weight over all minimal total dominating functions of G. In this paper we show that: (1