Global alliances and independence in trees

DOI10.7151/dmgt.1340zbMath1189.05123OpenAlexW2005870236MaRDI QIDQ5444052

Teresa W. Haynes, Mustapha Chellali

Publication date: 22 February 2008

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/9bc006e6e2c0f7320b101d705334bf993c05fa48

zbMATH Keywords

independence numbertreesdominationglobal allianceoffensive alliancedefensive alliance

Mathematics Subject Classification ID

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

Related Items (12)

On structural parameterizations of the offensive alliance problem ⋮ Parameterized intractability of defensive alliance problem ⋮ Structural parameterization of alliance problems ⋮ Partitioning a graph into offensive \(k\)-alliances ⋮ Bounds on global secure sets in cactus trees ⋮ Alliances in graphs: parameters, properties and applications -- a survey ⋮ Partitioning a graph into defensive \(k\)-alliances ⋮ Global defensive \(k\)-alliances in graphs ⋮ Offensive \(r\)-alliances in graphs ⋮ Alliances and Related Domination Parameters ⋮ The possible cardinalities of global secure sets in cographs ⋮ Defensive alliances in graphs

This page was built for publication: Global alliances and independence in trees