𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Pairs of Disjoint Dominating Sets and the Minimum Degree of Graphs

✍ Scribed by Christian Löwenstein; Dieter Rautenbach

Publisher
Springer Japan
Year
2010
Tongue
English
Weight
322 KB
Volume
26
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs with unique minimum edge dominati
Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices
✍ Jerzy Topp 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 816 KB

Topp, J., Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices, Discrete Mathematics 12 1 (1993) 199-210. A set I of vertices of a graph G is an independent set if no two vertices of I are adjacent. A set M of edges of G is an edge dominating s

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