✦ LIBER ✦

On the Algorithmic Complexity of Total Domination

✍ Scribed by Laskar, Renu; Pfaff, John; Hedetniemi, S. M.; Hedetniemi, S. T.

Book ID: 118213010
Publisher: Society for Industrial and Applied Mathematics
Year: 1984
Weight: 629 KB
Volume: 5
Category: Article
ISSN: 0196-5212
DOI: 10.1137/0605040

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The algorithmic complexity of minus domi

The algorithmic complexity of minus domination in graphs

✍ Jean Dunbar; Wayne Goddard; Stephen Hedetniemi; Alice McRae; Michael A. Henning 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 796 KB

On the computational complexity of upper

On the computational complexity of upper total domination

✍ 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

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

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 algorithmic complexity of static

On the algorithmic complexity of static structures

✍ Joel Ratsaby; J. Chaskalovic 📂 Article 📅 2010 🏛 Academy of Mathematics and Systems Science, Chines 🌐 English ⚖ 414 KB

On the computational complexity of upper

On the computational complexity of upper fractional domination

✍ Grant A. Cheston; G. Fricke; S.T. Hedetniemi; D. Pokrass Jacobs 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 769 KB