Global alliance partition in trees

zbMATH Open1160.05022MaRDI QIDQ3620532FDOQ3620532

Authors: Linda Eroh, Ralucca Gera 

Publication date: 14 April 2009

Recommendations

• Alliance partition number in graphs.
• Global defensive alliances in trees
• Some bounds on global alliances in trees
• Global alliances and independence in trees
• Partitioning a graph into defensive \(k\)-alliances

zbMATH Keywords

dominationglobal alliancealliance partition

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)

Cited In (13)

• Partitioning a graph into offensive \(k\)-alliances
• Partitioning a graph into defensive \(k\)-alliances
• Strategic balance in graphs
• Alliance partition number in graphs.
• The alliance partition number of grid graphs
• Bounds on global secure sets in cactus trees
• The possible cardinalities of global secure sets in cographs
• On the global offensive alliance number of a tree
• On the coalition number of trees
• Asymptotically almost every \(2r\)-regular graph has an internal partition
• Alliances in graphs: parameters, properties and applications -- a survey
• Title not available (Why is that?)
• Partitioning a graph into global powerful \(k\)-alliances

This page was built for publication: Global alliance partition in trees

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