Partitioning a graph into offensive \(k\)-alliances

DOI10.1016/J.DAM.2010.11.005zbMath1210.05114OpenAlexW2743337920WikidataQ57974381 ScholiaQ57974381MaRDI QIDQ629362

Sergio Bermudo, José María Sigarreta-Almira, Ismael González Yero, Juan Alberto Rodríguez-Velázquez

Publication date: 9 March 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.11.005

zbMATH Keywords

chromatic numberdomination numberdominating setsoffensive alliances

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (9)

Partitioning a graph into global powerful \(k\)-alliances ⋮ Global defensive alliances in the lexicographic product of paths and cycles ⋮ 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 ⋮ Alliance polynomial of regular graphs ⋮ A note on the global offensive alliances in graphs ⋮ Alliances and Related Domination Parameters ⋮ Saturated boundary \(k\)-alliances in graphs

Cites Work

• On global offensive \(k\)-alliances in graphs
• 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
• Defensive \(k\)-alliances in graphs
• Global defensive alliances in graphs
• The alliance partition number of grid graphs
• On defensive alliances and line graphs
• Offensive alliances in graphs
• Global alliances and independence in trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Partitioning a graph into offensive \(k\)-alliances