𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalized power domination of graphs

✍ Scribed by Gerard Jennhwa Chang; Paul Dorbec; Mickael Montassier; André Raspaud

Book ID
113564813
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
324 KB
Volume
160
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 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

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

Power Domination in Product Graphs
Power Domination in Product Graphs
✍ Dorbec, Paul; Mollard, Michel; Klavžar, Sandi; Špacapan, Simon 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 271 KB