Global defensive alliances in graphs
From MaRDI portal
Publication:1422134
zbMath1031.05096MaRDI QIDQ1422134
Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning
Publication date: 5 February 2004
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/123239
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
ON CONNECTED GLOBAL OFFENSIVE k-ALLIANCE NUMBER OF SOME GRAPHS, Strategic balance in graphs, Global defensive sets in graphs, Security in graphs, Global strong defensive alliances of Sierpiński-like graphs, Partitioning a graph into global powerful \(k\)-alliances, Global edge alliances in graphs, Secure sets and their expansion in cubic graphs, The complexity of open k-monopolies in graphs for negative k, Global defensive alliances in the lexicographic product of paths and cycles, On global defensive k-alliances in zero-divisor graphs of finite commutative rings, Global defensive alliances of trees and Cartesian product of paths and cycles, k-STRONG DEFENSIVE ALLIANCES IN GRAPHS, On dissemination thresholds in regular and irregular graph classes, Partitioning a graph into offensive \(k\)-alliances, Bounds on global secure sets in cactus trees, Alliances in graphs: parameters, properties and applications -- a survey, Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs, Some bounds on global alliances in trees, Upper bounds on the global offensive alliances in graphs, Global offensive alliances in graphs and random graphs, On defensive alliance in zero-divisor graphs, A survey and classification of Sierpiński-type graphs, Bounds on a graph's security number, Alliance polynomial of regular graphs, On defensive alliances and line graphs, Partitioning a graph into defensive \(k\)-alliances, Boundary defensive \(k\)-alliances in graphs, Complexity of secure sets, Global defensive \(k\)-alliances in graphs, On the global offensive alliance number of a graph, Offensive \(r\)-alliances in graphs, A note on the global offensive alliances in graphs, Alliances and Related Domination Parameters, Powerful alliances in graphs, Partitioning a graph into alliance free sets, On the complement graph and defensive \(k\)-alliances, Global defensive alliances in star graphs, Defensive \(k\)-alliances in graphs, The possible cardinalities of global secure sets in cographs, On a graph's security number, Unnamed Item, Saturated boundary \(k\)-alliances in graphs, An inequality on global alliances for trees, Linear time algorithms for weighted offensive and powerful alliances in trees, Global offensive alliances in graphs
