J. A. Rodriguez, J. M. Sigarreta
Published 2006-02-20Version 1
In this paper we obtain several tight bounds on different types of alliance numbers of a graph: (global) defensive alliance number, global offensive alliance number and global dual alliance number. In particular, we investigate the relationship between the alliance numbers of a graph and its algebraic connectivity, its spectral radius, and its Laplacian spectral radius.
Journal: Discussiones Mathematicae Graph Theory 27 (1) (2007) 143-157
On the global offensive alliance number of a graph
On the global offensive alliance in unicycle graphs
Computing global offensive alliances in Cartesian product graphs
![QR code for arXiv:math/0602436 [math.CO]](http://oss.arxitics.com/images/favicon.svg)