Partitioning a graph into global powerful k-alliances

DOI10.1007/S00373-011-1065-7zbMATH Open1256.05181DBLPjournals/gc/YeroR12OpenAlexW2040454935WikidataQ57974355 ScholiaQ57974355MaRDI QIDQ1926038FDOQ1926038

Authors: Ismael G. Yero, Juan A. 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

Recommendations

• Partitioning a graph into defensive \(k\)-alliances
• Boundary powerful \(k\)-alliances in graphs.
• Partitioning a graph into offensive \(k\)-alliances
• Alliance free sets in Cartesian product graphs
• Powerful alliances in graphs

zbMATH Keywords

Cartesian product graphsdefensive \(k\)-alliancesoffensive \(k\)-alliancespowerful \(k\)-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
• Global alliances in planar graphs
• Global alliance partition in trees
• Title not available (Why is that?)
• Alliance partition number in graphs.
• Spectral study of alliances in graphs
• Title not available (Why is that?)
• On the global offensive alliance number of a graph
• Offensive \(r\)-alliances in graphs
• Offensive alliances in cubic graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Offensive alliances in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Powerful alliances in graphs
• Partitioning a graph into offensive \(k\)-alliances
• The alliance partition number of grid graphs
• Partitioning a graph into defensive \(k\)-alliances
• On global offensive \(k\)-alliances in graphs

Cited In (7)

• Partitioning a graph into offensive \(k\)-alliances
• Saturated boundary \(k\)-alliances in graphs
• Partitioning a graph into defensive \(k\)-alliances
• Partitioning a graph into alliance free sets
• 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

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

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