Spectral study of alliances in graphs

DOI10.7151/DMGT.1351MaRDI QIDQ5444064zbMATH OpenOpenAlexFDO

Authors Juan A. Rodríguez-Velázquez, Jose M. Sigarreta

Publication date 22 February 2008

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0602436

zbMATH Keywords

graph eigenvaluesspectral radius

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Inequalities involving eigenvalues and eigenvectors (15A42)

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.

Recommendations

• scientific article; zbMATH DE number 2104820
• On the global offensive alliance number of a graph
• On defensive alliances and line graphs
• scientific article; zbMATH DE number 2076807
• Strong alliances in graphs

Cited in

(22)

• Global defensive \(k\)-alliances in graphs
• On the global offensive alliance number of a graph
• Offensive \(r\)-alliances in graphs
• On the complement graph and defensive \(k\)-alliances
• Global defensive alliances in star graphs
• Defensive k-alliances in graphs
• Alliances in graphs: parameters, properties and applications -- a survey
• A note on the global offensive alliances in graphs
• Partitioning a graph into global powerful k-alliances
• Upper bounds on the global offensive alliances in graphs
• An inequality on global alliances for trees
• Linear time algorithms for weighted offensive and powerful alliances in trees
• Some bounds on global alliances in trees
• Global offensive alliances in graphs and random graphs
• Global defensive sets in graphs
• Alliances and Related Domination Parameters
• Global strong defensive alliances of Sierpiński-like graphs
• Computing the strong alliance polynomial of a graph
• Partitioning a graph into defensive k-alliances
• Some results on the k-alliance and domination of graphs
• Minimum-cardinality global defensive alliances in general graphs
• Boundary defensive k-alliances in graphs

This page was built for publication: Spectral study of alliances in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5444064)