Spectral study of alliances in graphs
Discussiones Mathematicae. Graph Theory, Tome 27 (2007) no. 1, pp. 143-157
Voir la notice de l'article provenant de la source Library of Science
In this paper we obtain several tight bounds on different types of alliance numbers of a graph, namely (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.
Keywords:
defensive alliance, offensive alliance, dual alliance, domination, spectral radius, graph eigenvalues.
@article{DMGT_2007_27_1_a12,
author = {Rodr{\'\i}guez-Velazquez, Juan and Almira, Jose},
title = {Spectral study of alliances in graphs},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {143--157},
publisher = {mathdoc},
volume = {27},
number = {1},
year = {2007},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2007_27_1_a12/}
}
Rodríguez-Velazquez, Juan; Almira, Jose. Spectral study of alliances in graphs. Discussiones Mathematicae. Graph Theory, Tome 27 (2007) no. 1, pp. 143-157. http://geodesic.mathdoc.fr/item/DMGT_2007_27_1_a12/