𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Yuan Hong; Jin-Long Shu

Book ID
108316478
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
52 KB
Volume
211
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Nordhaus–Gaddum bounds on the -rainbow d
Nordhaus–Gaddum bounds on the -rainbow domatic number of a graph
✍ D. Meierling; S.M. Sheikholeslami; L. Volkmann 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 212 KB

For a positive integer k, a k-rainbow dominating function of a graph G is a function f from the vertex set V (G) to the set of all subsets of the set {1, 2, . . . , k} such that for any vertex rainbow dominating family (of functions) on G. The maximum number of functions in a k-rainbow dominating f

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