Global alliances and independence in trees
From MaRDI portal
Publication:5444052
DOI10.7151/dmgt.1340zbMath1189.05123MaRDI 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
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Parameterized intractability of defensive alliance problem, Structural parameterization of alliance problems, Bounds on global secure sets in cactus trees, Partitioning a graph into defensive \(k\)-alliances, Partitioning a graph into offensive \(k\)-alliances, The possible cardinalities of global secure sets in cographs, Global defensive \(k\)-alliances in graphs, Offensive \(r\)-alliances in graphs, Alliances in graphs: parameters, properties and applications -- a survey, Defensive alliances in graphs, On structural parameterizations of the offensive alliance problem, Alliances and Related Domination Parameters