𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On global offensive -alliances in graphs

✍ Scribed by Sergio Bermudo; Juan A. Rodríguez-Velázquez; José M. Sigarreta; Ismael G. Yero

Book ID
104000960
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
281 KB
Volume
23
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

✦ Synopsis

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 Γ i , i ∈ {1, 2}, and the (global

for some specific values of k. As a consequence of the study, we obtain bounds on the global offensive k-alliance number in terms of several parameters of the graph.

📜 SIMILAR VOLUMES

Offensive -alliances in graphs
Offensive -alliances in graphs
✍ Henning Fernau; Juan A. Rodríguez; José M. Sigarreta 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 420 KB
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