Global alliance partition in trees

MaRDI QIDQ3620532zbMATH OpenFDO

Authors Linda Eroh, Ralucca Gera

Publication date 14 April 2009

zbMATH Keywords

alliance partitiondominationglobal alliance

Mathematics Subject Classification ID

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

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

Cited in

(13)

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

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)