✦ LIBER ✦

A Nordhaus-Gaddum-type result for the induced path number

✍ Scribed by Johannes H. Hattingh, Osama A. Saleh, Lucas C. van der Merwe, Terry J. Walters

Book ID: 118801977
Publisher: Springer US
Year: 2011
Tongue: English
Weight: 456 KB
Volume: 24
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-011-9388-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Nordhaus-Gaddum results for the sum of t

Nordhaus-Gaddum results for the sum of the induced path number of a graph and its complement

✍ Johannes H. Hattingh, Ossama A. Saleh, Lucas C. van Der Merwe, Terry J. Walters 📂 Article 📅 2012 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 201 KB

New Nordhaus-Gaddum-type results for the

New Nordhaus-Gaddum-type results for the Kirchhoff index

✍ Yujun Yang; Heping Zhang; Douglas J. Klein 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 164 KB

Nordhaus-Gaddum results for the convex d

Nordhaus-Gaddum results for the convex domination number of a graph

✍ M. Lemańska, J. A. Rodríguez-Velázquez, I. Gonzalez Yero 📂 Article 📅 2012 🏛 Springer Netherlands 🌐 English ⚖ 341 KB

On Hadwiger's number— a problem of the N

On Hadwiger's number— a problem of the Nordhaus-Gaddum type

✍ M. Stiebitz 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 700 KB

Stiebitz, M., On Hadwiger's number-A problem of the Nordhaus-Gaddum type, Discrete Mathematics 101 (1992) 307-317. The Hadwiger number of a graph G = (V, E), denoted by q(G), is the maximum size of a complete graph to which G can be contracted. Let %((n, k):= {G 1 IV(G)1 = n and n(G) = k}. We shall

On the Nordhaus-Gaddum Problem for the k

On the Nordhaus-Gaddum Problem for the k-Defective Chromatic Number of a Graph

✍ Nirmala Achuthan N. R. Achuthan; M. Simanihuruk 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 201 KB

A sharp upper bound for the spectral rad

A sharp upper bound for the spectral radius of the Nordhaus–Gaddum type

✍ Yuan Hong; Jin-Long Shu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 52 KB