Partitioning a graph into global powerful \(k\)-alliances

DOI10.1007/s00373-011-1065-7zbMath1256.05181DBLPjournals/gc/YeroR12OpenAlexW2040454935WikidataQ57974355 ScholiaQ57974355MaRDI QIDQ1926038

Ismael González Yero, Juan Alberto Rodríguez-Velázquez

Publication date: 27 December 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1065-7

zbMATH Keywords

Cartesian product graphsdefensive \(k\)-alliancesoffensive \(k\)-alliancespowerful \(k\)-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 (4)

Global defensive alliances in the lexicographic product of paths and cycles ⋮ Alliances in graphs: parameters, properties and applications -- a survey ⋮ Alliances and Related Domination Parameters ⋮ Saturated boundary \(k\)-alliances in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning a graph into defensive \(k\)-alliances
• On global offensive \(k\)-alliances in graphs
• Partitioning a graph into offensive \(k\)-alliances
• 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
• Global defensive alliances in graphs
• The alliance partition number of grid graphs
• Global alliances in planar graphs
• Offensive alliances in cubic graphs
• Offensive alliances in graphs
• Spectral study of alliances in graphs

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