Spectral study of alliances in graphs

DOI10.7151/dmgt.1351zbMath1133.05072arXivmath/0602436OpenAlexW2040495536MaRDI QIDQ5444064

Juan Alberto Rodríguez-Velázquez, José María Sigarreta-Almira

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

spectral radiusgraph eigenvalues

Mathematics Subject Classification ID

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

Related Items (20)

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

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