✦ LIBER ✦

Domination number in graphs with minimum degree two

✍ Scribed by Er Fang Shan; Moo Young Sohn; Xu Dong Yuan; Michael A. Henning

Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2009
Tongue: English
Weight: 264 KB
Volume: 25
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s10114-009-7617-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Domination in graphs with minimum degree

Domination in graphs with minimum degree two

✍ William McCuaig; Bruce Shepherd 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 545 KB

The domination number y ( G ) of a graph G = (V E ) is the minimum cardinality of a subset of Vsuch that every vertex is either in the set or is adjacent to some vertex in the set. We show that if a connected graph G has minimum2degree two and is not one of seven exceptional graphs, then y ( g ) I ~

Bounds related to domination in graphs w

✍ Sanchis, Laura A. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB 👁 2 views

A dominating set for a graph G = (V, E) is a subset of vertices V ⊆ V such that for all v ∈ V -V there exists some u ∈ V for which {v, u} ∈ E. The domination number of G is the size of its smallest dominating set(s). We show that for almost all connected graphs with minimum degree at least 2 and q e

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

Total domination in graphs with minimum

Total domination in graphs with minimum degree three

✍ Favaron, Odile; Henning, Michael A.; Mynhart, Christina M.; Puech, Jo�l 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 132 KB 👁 3 views

A set S of vertices of a graph G is a total dominating set, if every vertex of V (G) is adjacent to some vertex in S. The total domination number of G, denoted by γ t (G), is the minimum cardinality of a total dominating set of G. We prove that, if G is a graph of order n with minimum degree at leas

Domination in Graphs of Minimum Degree F

Domination in Graphs of Minimum Degree Five

✍ Hua-Ming Xing; Liang Sun; Xue-Gang Chen 📂 Article 📅 2006 🏛 Springer Japan 🌐 English ⚖ 151 KB