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
## 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
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 Γ