𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Small alliances in a weighted graph

✍ Scribed by Kenji Kimura; Masayuki Koyama; Akira Saito


Book ID
108112900
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
201 KB
Volume
158
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Partitioning a graph into defensivek-all
✍ Ismael G. Yero; Sergio Bermudo; Juan A. Rodríguez-Velázquez; José M. Sigarreta 📂 Article 📅 2010 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 230 KB
Defensive -alliances in graphs
✍ Juan A. Rodríguez-Velázquez; Ismael G. Yero; José M. Sigarreta 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 412 KB

## a b s t r a c t Let G = (V, E) be a simple graph of order n and degree sequence The defensive k-alliance number of G, denoted by a k (G), is defined as the minimum cardinality of a defensive k-alliance in G. We study the mathematical properties of a k (G). We show , where µ is the algebraic c

Powerful alliances in graphs
✍ Robert C. Brigham; Ronald D. Dutton; Teresa W. Haynes; Stephen T. Hedetniemi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 647 KB
Offensive -alliances in graphs
✍ Henning Fernau; Juan A. Rodríguez; José M. Sigarreta 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 420 KB
On global offensive -alliances in graphs
✍ Sergio Bermudo; Juan A. Rodríguez-Velázquez; José M. Sigarreta; Ismael G. Yero 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 281 KB

We investigate the relationship between global offensive k-alliances and some characteristic sets of a graph including r-dependent sets, τ -dominating sets and standard dominating sets. In addition, we discuss the close relationships that exist among the (global) offensive k i -alliance number of Γ