Partitioning a graph into offensive k-alliances

DOI10.1016/J.DAM.2010.11.005zbMATH Open1210.05114OpenAlexW2743337920WikidataQ57974381 ScholiaQ57974381MaRDI QIDQ629362FDOQ629362

Authors: Sergio Bermudo, Jose M. Sigarreta, Ismael G. Yero, Juan A. 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

Recommendations

• Partitioning a graph into defensive \(k\)-alliances
• Partitioning a graph into global powerful \(k\)-alliances
• Bounds on the global offensive \(k\)-alliance number in graphs
• Global offensive \(k\)-alliance in bipartite graphs
• On global offensive \(k\)-alliances in graphs

zbMATH Keywords

domination numberchromatic numberdominating setsoffensive alliances

Mathematics Subject Classification ID

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

Cites Work

• Global defensive \(k\)-alliances in graphs
• Defensive \(k\)-alliances in graphs
• Global defensive alliances in graphs
• On defensive alliances and line graphs
• Global alliance partition in trees
• Title not available (Why is that?)
• Alliance partition number in graphs.
• Title not available (Why is that?)
• On the global offensive alliance number of a graph
• Offensive \(r\)-alliances in graphs
• Title not available (Why is that?)
• Offensive alliances in graphs
• Title not available (Why is that?)
• Global alliances and independence in trees
• On the complement graph and defensive \(k\)-alliances
• The alliance partition number of grid graphs
• On global offensive \(k\)-alliances in graphs

Cited In (12)

• Upper bounds on the global offensive alliances in graphs
• Saturated boundary \(k\)-alliances in graphs
• Partitioning a graph into defensive \(k\)-alliances
• Alliance free sets in Cartesian product graphs
• Title not available (Why is that?)
• A note on the global offensive alliances in graphs
• Alliances and Related Domination Parameters
• Global defensive alliances in the lexicographic product of paths and cycles
• Alliances in graphs: parameters, properties and applications -- a survey
• Offensive \(r\)-alliances in graphs
• Partitioning a graph into global powerful \(k\)-alliances
• Alliance polynomial of regular graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q629362)