𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the domination number of Hamiltonian graphs with minimum degree six

✍ Scribed by Hua-Ming Xing; Johannes H. Hattingh; Andrew R. Plummer

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
177 KB
Volume
21
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

✦ Synopsis

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 .

πŸ“œ SIMILAR VOLUMES

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

The number of cutvertices in graphs with
The number of cutvertices in graphs with given minimum degree
✍ L.H. Clark; R.C. Entringer πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 453 KB

The maximum number of cutvertices in a connected graph of order n having minimum degree at least 6 is determined for 6 > 5.

Graph decomposition with constraints on
Graph decomposition with constraints on the minimum degree
✍ John Sheehan πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 888 KB

Let G be a finite simple graph on n vertices with minimum degree 6(G) 3 6 (n = 6 (mod 2)). Let max(k, G) denote the set of all k-subsets A E V(G) such that the number of edges in the induced subgraph (A) is a maximum. We prove that for some i E (0, 1.2, . . . ). Analogous edge density constraints, r