✦ LIBER ✦

An improved upper bound for queens domination numbers

✍ Scribed by A.P. Burger; C.M. Mynhardt

Book ID: 108315852
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 153 KB
Volume: 266
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00802-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Upper Bound for the Independent Domin

An Upper Bound for the Independent Domination Number

✍ Liang Sun; Jianfang Wang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 87 KB

Let G be a simple graph of order n and minimum degree $. The independent domination number i(G) is defined to be the minimum cardinality among all maximal independent sets of vertices of G. In this paper, we show that i(G) n+2$&2 -n$. Thus a conjecture of Favaron is settled in the affirmative.

An upper bound for ramsey numbers

✍ Yusheng Li; C.C Rousseau; Wenan Zang 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 138 KB

Upper bounds for ƒ-domination number of

Upper bounds for ƒ-domination number of graphs

✍ Beifang Chen; Sanming Zhou 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 200 KB

An upper bound for the k-domination numb

An upper bound for the k-domination number of a graph

✍ E. J. Cockayne; B. Gamble; B. Shepherd 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB 👁 2 views

The kdomination number of a graph G, y k ( G ) , is the least cardinality of a set U of verticies such that any other vertex is adjacent to at least k vertices of U. We prove that if each vertex has degree at least k. then YAG) 5 kp/(k + 1).

An upper bound for some ramsey numbers

✍ Andrew Thomason 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 307 KB 👁 1 views

New upper bounds for the ramsey numbers r ( k , I ) are obtained. In particular it is shown there is a constant A such that The ramsey number r(k, l ) is the smallest integer n, such that any coloring with red and blue of the edges of the complete graph K , of order n yields either a red K , subgra

Upper bounds on the paired-domination nu

Upper bounds on the paired-domination number

✍ Xue-gang Chen; Wai Chee Shiu; Wai Hong Chan 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 199 KB

A set S of vertices in a graph G is a paired-dominating set of G if every vertex of G is adjacent to some vertex in S and the subgraph induced by S contains a perfect matching. The minimum cardinality of a paired-dominating set of G is the paireddomination number of G, denoted by γ pr (G). In this w