𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Multiple factor Nordhaus–Gaddum type results for domination and total domination

✍ Scribed by Michael A. Henning; Ernst J. Joubert; Justin Southey

Book ID
118435442
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
253 KB
Volume
160
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Nordhaus–Gaddum bounds for total dominat
Nordhaus–Gaddum bounds for total domination
✍ Michael A. Henning; Ernst J. Joubert; Justin Southey 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 227 KB

A Nordhaus-Gaddum-type result is a (tight) lower or upper bound on the sum or product of a parameter of a graph and its complement. In this paper we continue the study of Nordhaus-Gaddum bounds for the total domination number γ t . Let G be a graph on n vertices and let G denote the complement of G,

On a Nordhaus-Gaddum type problem for in
On a Nordhaus-Gaddum type problem for independent domination
✍ E.J. Cockayne; G. Fricke; C.M. Mynhardt 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 254 KB

Let i(G) (i(G), respectively) be the independent domination number (i.e. smallest cardinality of a maximal independent vertex subset) of the p-vertex graph G (the complement G of G, respectively). We prove limp~[max~ i(G)i(Cr)/p 2] = 1/16.