Offensive alliances in cubic graphs
From MaRDI portal
Publication:3433453
DOI10.12988/imf.2006.06152zbMath1116.05060arXivmath/0610023OpenAlexW1565752646MaRDI QIDQ3433453
No author found.
Publication date: 30 April 2007
Published in: International Mathematical Forum (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0610023
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (16)
A study of monopolies in graphs ⋮ Global strong defensive alliances of Sierpiński-like graphs ⋮ Partitioning a graph into global powerful \(k\)-alliances ⋮ On defensive alliances and strong global offensive 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 ⋮ Boundary defensive \(k\)-alliances in graphs ⋮ Global defensive \(k\)-alliances in graphs ⋮ On the global offensive alliance number of a graph ⋮ A note on the global offensive alliances in graphs ⋮ Global defensive alliances in star graphs ⋮ Defensive \(k\)-alliances in graphs ⋮ An inequality on global alliances for trees ⋮ Linear time algorithms for weighted offensive and powerful alliances in trees
This page was built for publication: Offensive alliances in cubic graphs
