On global offensive \(k\)-alliances in graphs
From MaRDI portal
Publication:602832
DOI10.1016/j.aml.2010.08.008zbMath1208.05096arXiv0812.1528OpenAlexW1965927974WikidataQ57974412 ScholiaQ57974412MaRDI QIDQ602832
Sergio Bermudo, Juan Alberto Rodríguez-Velázquez, José María Sigarreta-Almira, Ismael González Yero
Publication date: 5 November 2010
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0812.1528
Related Items
Partitioning a graph into global powerful \(k\)-alliances ⋮ Global defensive alliances in the lexicographic product of paths and cycles ⋮ Partitioning a graph into offensive \(k\)-alliances ⋮ Alliances in graphs: parameters, properties and applications -- a survey ⋮ Alliance free sets in Cartesian product graphs ⋮ Upper bounds on the global offensive alliances in graphs ⋮ Alliances and Related Domination Parameters
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Powerful alliances in graphs
- Defensive \(k\)-alliances in graphs
- On \(k\)-dependent domination
- \(\alpha\)-domination
- On defensive alliances and line graphs
- Offensive alliances in graphs
