Spectral study of alliances in graphs

Simple item page
dc.creatorRodriguez, J. A.
dc.creatorSigarreta, J. M.
dc.date2006-02-20
dc.date.accessioned2026-07-07T07:52:33Z
dc.date.available2026-07-07T07:52:33Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/math/0602436
dc.identifierhttp://arxiv.org/abs/math/0602436
dc.identifierDiscussiones Mathematicae Graph Theory 27 (1) (2007) 143-157
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/125921
dc.subjectCombinatorics
dc.subject05C69; 15A42; 05C50
dc.titleSpectral study of alliances in graphs
dc.typetext

Files

Collections

arXiv