๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An upper bound on the domination number of a graph with minimum degree 2

โœ Scribed by Allan Frendrup; Michael A. Henning; Bert Randerath; Preben Dahl Vestergaard

Book ID
108113991
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
621 KB
Volume
309
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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).

On the domination number of Hamiltonian
On the domination number of Hamiltonian graphs with minimum degree six
โœ Hua-Ming Xing; Johannes H. Hattingh; Andrew R. Plummer ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 177 KB

The domination number of G, denoted by ฮณ (G), is the minimum cardinality of a dominating set of G. We prove that if G is a Hamiltonian graph of order n with minimum degree at least six, then ฮณ (G) โ‰ค 6n 17 .

On the independent domination number of
On the independent domination number of graphs with given minimum degree
โœ N.I. Glebov; A.V. Kostochka ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 175 KB

We prove a new upper bound on the independent domination number of graphs in terms of the number of vertices and the minimum degree. This bound is slightly better than that of Haviland (1991) and settles the case 6 = 2 of the corresponding conjecture by Favaron (1988). @ 1998 Elsevier Science B.V. A