Spectral study of alliances in graphs
classification
🧮 math.CO
keywords
allianceglobalnumberspectralgraphnumbersradiusalgebraic
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.