On the global offensive alliance number of a graph
From MaRDI portal
Publication:1003662
DOI10.1016/j.dam.2008.02.007zbMath1191.05072arXivmath/0602432OpenAlexW2161713493WikidataQ57974455 ScholiaQ57974455MaRDI QIDQ1003662
Publication date: 4 March 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0602432
Related Items (26)
On structural parameterizations of the offensive alliance problem ⋮ A study of monopolies in graphs ⋮ On global offensive \(k\)-alliances in graphs ⋮ Partitioning a graph into global powerful \(k\)-alliances ⋮ Globally minimal defensive alliances ⋮ Secure sets and their expansion in cubic graphs ⋮ Global defensive alliances in the lexicographic product of paths and cycles ⋮ Parameterized intractability of defensive alliance problem ⋮ Partitioning a graph into offensive \(k\)-alliances ⋮ Alliance free and alliance cover sets ⋮ On defensive alliances and strong global offensive 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 ⋮ Global offensive alliances in graphs and random graphs ⋮ Integer programming approach to static monopolies in graphs ⋮ Partitioning a graph into defensive \(k\)-alliances ⋮ Boundary defensive \(k\)-alliances in graphs ⋮ Global defensive \(k\)-alliances in graphs ⋮ Offensive \(r\)-alliances in graphs ⋮ A note on the global offensive alliances in graphs ⋮ Alliances and Related Domination Parameters ⋮ Defensive alliances in graphs ⋮ On the complexity of reasoning about opinion diffusion under majority dynamics ⋮ Saturated boundary \(k\)-alliances in graphs ⋮ Linear time algorithms for weighted offensive and powerful alliances in trees
Cites Work
This page was built for publication: On the global offensive alliance number of a graph
