scientific article; zbMATH DE number 2104820
From MaRDI portal
Publication:4820818
zbMath1051.05068MaRDI QIDQ4820818
Sandra M. Hedetniemi, Petter Kristiansen, Stephen T. Hedetniemi
Publication date: 1 October 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (84)
ON CONNECTED GLOBAL OFFENSIVE k-ALLIANCE NUMBER OF SOME GRAPHS ⋮ Strategic balance in graphs ⋮ Parameterized complexity of locally minimal defensive alliances ⋮ Defensive alliances in graphs of bounded treewidth ⋮ Structural and algorithmic properties of 2-community structures ⋮ Security in graphs ⋮ On the global offensive alliance in unicycle graphs ⋮ On structural parameterizations of the offensive alliance problem ⋮ The security number of strong grid-like graphs ⋮ Bounds for metric dimension and defensive $k$-alliance of graphs under deleted lexicographic product ⋮ New sharp lower bound for the quorum coloring number of trees ⋮ A study of monopolies in graphs ⋮ On some open problems concerning quorum colorings of graphs ⋮ Global strong defensive alliances of Sierpiński-like graphs ⋮ On global offensive \(k\)-alliances in graphs ⋮ Small alliances in a weighted graph ⋮ Partitioning a graph into global powerful \(k\)-alliances ⋮ Globally minimal defensive alliances ⋮ Global edge alliances in graphs ⋮ Self-stabilizing algorithms for minimal global powerful alliance sets in graphs ⋮ Secure sets and their expansion in cubic graphs ⋮ Secure domination of some graph operators ⋮ Global defensive alliances in the lexicographic product of paths and cycles ⋮ Parameterized intractability of defensive alliance problem ⋮ 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 ⋮ Bounding the open \(k\)-monopoly number of strong product graphs ⋮ Structural parameterization of alliance problems ⋮ Security in Sierpiński graphs ⋮ k-STRONG DEFENSIVE ALLIANCES IN GRAPHS ⋮ Partitioning a graph into offensive \(k\)-alliances ⋮ Bounds on global secure sets in cactus trees ⋮ Extended MSO model checking via small vertex integrity ⋮ Alliance free and alliance cover sets ⋮ On defensive alliances and strong global offensive alliances ⋮ The security number of lexicographic products ⋮ Alliances in graphs: parameters, properties and applications -- a survey ⋮ Client-server and cost effective sets in graphs ⋮ Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs ⋮ On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities ⋮ A general view on computing communities ⋮ Some bounds on global alliances in trees ⋮ Alliance free sets in Cartesian product graphs ⋮ Upper bounds on the global offensive alliances in graphs ⋮ Global offensive alliances in graphs and random graphs ⋮ On the security number of the Cartesian product of graphs ⋮ Multivariate algorithmics for finding cohesive subnetworks ⋮ On defensive alliance in zero-divisor graphs ⋮ Distribution centers in graphs ⋮ Bounds on a graph's security number ⋮ Alliance polynomial of regular graphs ⋮ Distribution of global defensive \(k\)-alliances over some graph products ⋮ On defensive alliances and line graphs ⋮ Security number of grid-like graphs ⋮ Properties of graphs specified by a regular language ⋮ Partitioning a graph into defensive \(k\)-alliances ⋮ Satisfactory graph partition, variants, and generalizations ⋮ Boundary defensive \(k\)-alliances in graphs ⋮ Aspects of upper defensive alliances ⋮ Alliances in graphs of bounded clique-width ⋮ 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 ⋮ \((F, I)\)-security in graphs ⋮ Approximability of open \(k\)-monopoly problems ⋮ 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 ⋮ Defensive alliances in graphs ⋮ On a graph's security number ⋮ Unnamed Item ⋮ Proportionally dense subgraph of maximum size: complexity and approximation ⋮ On the complexity of some quorum colorings problems of graphs ⋮ Saturated boundary \(k\)-alliances in graphs ⋮ An inequality on global alliances for trees ⋮ Linear time algorithms for weighted offensive and powerful alliances in trees ⋮ Offensive alliances in graphs ⋮ Global offensive alliances in graphs ⋮ (Dis)assortative partitions on random regular graphs
This page was built for publication:
