𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On average lower independence and domination numbers in graphs

✍ Scribed by Mostafa Blidia; Mustapha Chellali; Frédéric Maffray

Book ID
108113519
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
213 KB
Volume
295
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On graphs with equal domination and inde
On graphs with equal domination and independent domination numbers
✍ Jerzy Topp; Lutz Volkmann 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 284 KB

Topp, J. and L. Volkmann, On graphs wi',h equal domination and independent domination number, Discrete Mathematics 96 (1991) 75-80. Allan and Laskar have shown that Kt.s-free graphs are graphs with equal domination and independent domination numbers. In this paper new classes of graphs with equal d

On domination and independent domination
On domination and independent domination numbers of a graph
✍ Robert B. Allan; Renu Laskar 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 399 KB

For a graph G, the definitions of doknation number, denoted y(G), and independent domination number, denoted i(G), are given, and the following results are obtained: oorollrrg 1. For any graph G, y(L(G)) = i@(G)), where Z,(G) is the line graph of G. (This $xh!s t.lic rtsult ~(L(T))~i(L(T)), h w ere

Generalized independence and domination
Generalized independence and domination in graphs
✍ Mieczysław Borowiecki; Danuta Michalak 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 286 KB

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 Fav