scientific article
From MaRDI portal
Publication:3423990
zbMath1113.05074MaRDI QIDQ3423990
Aurel Cami, Narsingh Deo, Hemant Balakrishnan, Ronald D. Dutton
Publication date: 15 February 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (22)
Global defensive sets in graphs ⋮ Parameterized complexity of locally minimal defensive alliances ⋮ Globally minimal defensive alliances ⋮ Global edge alliances in graphs ⋮ Global defensive alliances in the lexicographic product of paths and cycles ⋮ Global defensive alliances of trees and Cartesian product of paths and cycles ⋮ Bounds on global secure sets in cactus trees ⋮ Extended MSO model checking via small vertex integrity ⋮ On defensive alliances and strong global offensive alliances ⋮ Client-server and cost effective sets 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 ⋮ Alliances in graphs of bounded clique-width ⋮ Global defensive \(k\)-alliances in graphs ⋮ Offensive \(r\)-alliances in graphs ⋮ A note on the global offensive alliances in graphs ⋮ Algorithms and Complexity of Alliances in Graphs ⋮ On the complement graph and defensive \(k\)-alliances ⋮ Global defensive alliances in star graphs ⋮ The possible cardinalities of global secure sets in cographs ⋮ Linear time algorithms for weighted offensive and powerful alliances in trees
This page was built for publication:
