Spectral study of alliances in graphs
Combinatorics
2007-05-23 v1
Abstract
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.
Cite
@article{arxiv.math/0602436,
title = {Spectral study of alliances in graphs},
author = {J. A. Rodriguez and J. M. Sigarreta},
journal= {arXiv preprint arXiv:math/0602436},
year = {2007}
}