𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Offensive -alliances in graphs

✍ Scribed by Henning Fernau; Juan A. Rodríguez; José M. Sigarreta

Book ID
108112771
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
420 KB
Volume
157
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On global offensive -alliances in graphs
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 Γ

Defensive -alliances in graphs
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
Powerful alliances in graphs
✍ Robert C. Brigham; Ronald D. Dutton; Teresa W. Haynes; Stephen T. Hedetniemi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 647 KB
Small alliances in a weighted graph
Small alliances in a weighted graph
✍ Kenji Kimura; Masayuki Koyama; Akira Saito 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 201 KB