Offensive alliances in graphs
From MaRDI portal
Recommendations
Cited in
(41)- Global defensive \(k\)-alliances in graphs
- On the global offensive alliance number of a graph
- Offensive \(r\)-alliances in graphs
- Powerful alliances in graphs
- Partitioning a graph into alliance free sets
- Global defensive alliances in star graphs
- Defensive k-alliances in graphs
- On a graph's security number
- On the global offensive alliance in unicycle graphs
- Alliances in graphs: parameters, properties and applications -- a survey
- A note on the global offensive alliances in graphs
- Partitioning a graph into global powerful k-alliances
- Global defensive alliances in the lexicographic product of paths and cycles
- Upper bounds on the global offensive alliances in graphs
- Saturated boundary \(k\)-alliances in graphs
- Security in graphs
- On defensive alliances and strong global offensive alliances
- Global offensive alliances in graphs and random graphs
- Bounds on a graph's security number
- On defensive alliances and line graphs
- Open alliance in graphs
- Alliances and Related Domination Parameters
- Algorithms and Complexity of Alliances in Graphs
- Global offensive alliances in graphs
- scientific article; zbMATH DE number 5777940 (Why is no real title available?)
- A study of monopolies in graphs
- Global strong defensive alliances of Sierpiński-like graphs
- scientific article; zbMATH DE number 2170476 (Why is no real title available?)
- The complexity of open \(k\)-monopolies in graphs for negative \(k\)
- On defensive alliance in zero-divisor graphs
- Self-stabilizing algorithms for unfriendly partitions into two disjoint dominating sets
- Partitioning a graph into defensive k-alliances
- On global offensive \(k\)-alliances in graphs
- Small alliances in a weighted graph
- k-STRONG DEFENSIVE ALLIANCES IN GRAPHS
- Partitioning a graph into offensive k-alliances
- Offensive alliances in signed graphs
- On the global powerful alliance number of zero-divisor graphs of finite commutative rings
- Offensive alliances in signed graphs
- Some results on the k-alliance and domination of graphs
- Boundary defensive k-alliances in graphs
This page was built for publication: Offensive alliances in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4669433)