Partitioning a graph into global powerful k-alliances

DOI10.1007/S00373-011-1065-7MaRDI QIDQ1926038zbMATH OpenOpenAlexDBLPWikidataFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 1933255 (Why is no real title available?)
• scientific article; zbMATH DE number 2076807 (Why is no real title available?)
• scientific article; zbMATH DE number 2077650 (Why is no real title available?)
• scientific article; zbMATH DE number 2170476 (Why is no real title available?)
• scientific article; zbMATH DE number 2104820 (Why is no real title available?)
• scientific article; zbMATH DE number 5056647 (Why is no real title available?)
• Alliance partition number in graphs.
• Defensive \(k\)-alliances in graphs
• Global alliance partition in trees
• Global alliances in planar graphs
• Global defensive \(k\)-alliances in graphs
• Global defensive alliances in graphs
• Offensive \(r\)-alliances in graphs
• Offensive alliances in cubic graphs
• Offensive alliances in graphs
• On global offensive \(k\)-alliances in graphs
• On the global offensive alliance number of a graph
• Partitioning a graph into defensive \(k\)-alliances
• Partitioning a graph into offensive \(k\)-alliances
• Powerful alliances in graphs
• Spectral study of alliances in graphs
• The alliance partition number of grid graphs

Cited in

(9)

• Alliances and Related Domination Parameters
• Partitioning a graph into alliance free sets
• Partitioning a graph into defensive \(k\)-alliances
• Partitioning a graph into offensive \(k\)-alliances
• Alliance free sets in Cartesian product graphs
• Boundary powerful \(k\)-alliances in graphs.
• Global defensive alliances in the lexicographic product of paths and cycles
• Alliances in graphs: parameters, properties and applications -- a survey
• Saturated boundary \(k\)-alliances in graphs

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)