✦ LIBER ✦

Nordhaus–Gaddum for treewidth

✍ Scribed by Gwenaël Joret; David R. Wood

Book ID: 113582433
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 187 KB
Volume: 33
Category: Article
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2011.10.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Nordhaus–Gaddum results for genus

✍ Bickle, Allan; White, Arthur 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 320 KB

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,

Nordhaus–Gaddum bounds for locating domi

Nordhaus–Gaddum bounds for locating domination

✍ Hernando, C.; Mora, M.; Pelayo, I.M. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 415 KB

Some nordhaus-- gaddum-type results

✍ Wayne Goddard; Michael A. Henning; Henda C. Swart 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 500 KB

## Abstract A Nordhaus‐‐Gaddum‐type result is a (tgiht) lower or upper bound on the sum or product of a parameter of a graph and its complement. In this paper some variations are considered. First, the sums and products of ψ(__G__~1~) and ψ(__G__~2~) are examined where __G__~1~ ⊕ __G__~2~ = __K__(_

Nordhaus-Gaddum inequalities for dominat

Nordhaus-Gaddum inequalities for domination in graphs

✍ Frank Harary; Teresa W. Haynes 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 297 KB

A node in a graph G = (V,E) is said to dominate itself and all nodes adjacent to it. A set S C V is a dominating set for G if each node in V is dominated by some node in S and is a double dominating set for G if each node in V is dominated by at least two nodes in S. First we give a brief survey of

A note on Nordhaus–Gaddum inequalities f

A note on Nordhaus–Gaddum inequalities for domination

✍ Shan Erfang; Dang Chuangyin; Kang Liying 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 160 KB

For a graph G of order n, let (G), 2(G) and t (G) be the domination, double domination and total domination numbers of G, respectively. The minimum degree of the vertices of G is denoted by (G) and the maximum degree by (G). In this note we prove a conjecture due to Harary and Haynes saying that if