Strategic balance in graphs

DOI10.1016/J.DISC.2016.02.004MaRDI QIDQ279193zbMATH OpenOpenAlexFDO

Authors Robert Lewoń, Anna Małafiejska, Michal Malafiejski

Publication date 27 April 2016

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2016.02.004

zbMATH Keywords

alliance partitioning numberglobal alliancestrategic balance

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) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Global alliance partition in trees
• scientific article; zbMATH DE number 2104820
• Alliance partition number in graphs.
• Partitioning a graph into defensive k-alliances
• scientific article; zbMATH DE number 2076807

Cites work

• A note on graphs with disjoint dominating and total dominating sets
• Alliance partition number in graphs.
• Global alliance partition in trees
• Global defensive alliances in graphs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2104820 (Why is no real title available?)
• The Many Names of (7, 3, 1)

Cited in

(3)

• A balancing strategy
• Global edge alliances in graphs
• Strategy Graphs for Influence Diagrams

Describes a project that uses

Uses Software

• nauty

This page was built for publication: Strategic balance in graphs

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