𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalized independence and domination in graphs

✍ Scribed by Mieczysław Borowiecki; Danuta Michalak

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
286 KB
Volume
191
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

The purpose of this paper is to introduce various concepts of g?-domination, which generalize and unify different well-known kinds of domination in graphs. We generalize a result of Lov/tsz concerning the existence of a partition of a set of vertices of G into independent subsets and a result of Favaron concerning a property of Sk-dominating sets. Gallai-type equalities for the strong ~-domination number are proved, which generalize Nieminen's result.

📜 SIMILAR VOLUMES

Generalized domination and efficient dom
Generalized domination and efficient domination in graphs
✍ D.W. Bange; A.E. Barkauskas; L.H. Host; P.J. Slater 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 516 KB

This paper generalizes dominating and efficient dominating sets of a graph. Let G be a graph with vertex set V(G). If f: V(G) ~ Y, where Y is a subset of the reals, the weight off is the sum of f(v) over all ve V(G). If the closed neighborhood sum off(v) at every vertex is at least 1, thenfis called

Independence and hamiltonicity in 3-domi
Independence and hamiltonicity in 3-domination-critical graphs
✍ Favaron, Odile; Tian, Feng; Zhang, Lei 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 3 views

Let δ, γ, i and α be respectively the minimum degree, the domination number, the independent domination number and the independence number of a graph G. The graph G is 3-γ-critical if γ = 3 and the addition of any edge decreases γ by 1. It was conjectured that any connected 3-γ-critical graph satisf

Chordal graphs and upper irredundance, u
Chordal graphs and upper irredundance, upper domination and independence
✍ Michael S. Jacobson; Ken Peters 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 648 KB

In this paper we consider the following parameters: IR(G), the upper irredundance number, which is the order of the largest maximal irredundant set, I'(G), the upper domination number, which is the order of the largest minimal dominating set and /3(G), the independence number, which is the order of