## 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__(_
✦ LIBER ✦
Nordhaus–Gaddum results for genus
✍ Scribed by Bickle, Allan; White, Arthur
- Book ID
- 118737073
- Publisher
- Elsevier Science
- Year
- 2013
- Tongue
- English
- Weight
- 320 KB
- Volume
- 313
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Some nordhaus-- gaddum-type results
✍
Wayne Goddard; Michael A. Henning; Henda C. Swart
📂
Article
📅
1992
🏛
John Wiley and Sons
🌐
English
⚖ 500 KB
Nordhaus–Gaddum for treewidth
✍
Gwenaël Joret; David R. Wood
📂
Article
📅
2012
🏛
Elsevier Science
🌐
English
⚖ 187 KB
New Nordhaus-Gaddum-type results for the
✍
Yujun Yang; Heping Zhang; Douglas J. Klein
📂
Article
📅
2011
🏛
Springer
🌐
English
⚖ 164 KB
A Nordhaus-Gaddum-type result for the in
✍
Johannes H. Hattingh, Osama A. Saleh, Lucas C. van der Merwe, Terry J. Walters
📂
Article
📅
2011
🏛
Springer US
🌐
English
⚖ 456 KB
Nordhaus–Gaddum bounds for total dominat
✍
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
✍
Hernando, C.; Mora, M.; Pelayo, I.M.
📂
Article
📅
2014
🏛
Elsevier Science
🌐
English
⚖ 415 KB