Powerful alliances in graphs

DOI10.1016/J.DISC.2006.10.026zbMath1211.05101OpenAlexW1993232451MaRDI QIDQ1025468

Teresa W. Haynes, Stephen T. Hedetniemi, Ronald D. Dutton, Robert C. Brigham

Publication date: 19 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

dominationallianceoffensive allianceglobal powerful alliancedefensive alliancepowerful alliance

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (18)

Security in graphs ⋮ On global offensive \(k\)-alliances in graphs ⋮ Partitioning a graph into global powerful \(k\)-alliances ⋮ Self-stabilizing algorithms for minimal global powerful alliance sets in graphs ⋮ Secure sets and their expansion in cubic graphs ⋮ Global defensive alliances in the lexicographic product of paths and cycles ⋮ k-STRONG DEFENSIVE ALLIANCES IN GRAPHS ⋮ Alliances in graphs: parameters, properties and applications -- a survey ⋮ On defensive alliance in zero-divisor graphs ⋮ Bounds on a graph's security number ⋮ Partitioning a graph into defensive \(k\)-alliances ⋮ Boundary defensive \(k\)-alliances in graphs ⋮ Global defensive \(k\)-alliances in graphs ⋮ Alliances and Related Domination Parameters ⋮ Partitioning a graph into alliance free sets ⋮ On a graph's security number ⋮ Saturated boundary \(k\)-alliances in graphs ⋮ Linear time algorithms for weighted offensive and powerful alliances in trees

Cites Work

• Relations between packing and covering numbers of a tree
• Global defensive alliances in graphs
• Offensive alliances in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Powerful alliances in graphs