Alliances in graphs: parameters, properties and applications -- a survey
From MaRDI portal
Publication:1713564
DOI10.1016/j.akcej.2017.05.002zbMath1403.05115OpenAlexW2623809139MaRDI QIDQ1713564
Abdelkamel Tari, Kahina Ouazine, Hachem Slimani
Publication date: 25 January 2019
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.akcej.2017.05.002
graph class\(k\)-alliance partition numberboundary \(k\)-alliancedefensive \(k\)-allianceoffensive powerful \(k\)-alliancepartitioning of graphs
Related Items (2)
New sharp lower bound for the quorum coloring number of trees ⋮ Alliances and Related Domination Parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global defensive alliances of trees and Cartesian product of paths and cycles
- Partitioning a graph into defensive \(k\)-alliances
- On global offensive \(k\)-alliances in graphs
- Partitioning a graph into offensive \(k\)-alliances
- A new upper bound on the global defensive alliance number in trees
- Boundary defensive \(k\)-alliances in graphs
- Global defensive \(k\)-alliances in graphs
- On the global offensive alliance number of a graph
- Offensive \(r\)-alliances in graphs
- Global alliances and independent domination in some classes of graphs
- Powerful alliances in graphs
- On the complement graph and defensive \(k\)-alliances
- Global defensive alliances in star graphs
- Defensive \(k\)-alliances in graphs
- On a graph's security number
- Relations between packing and covering numbers of a tree
- Global defensive alliances in graphs
- Dynamic monopolies in tori.
- Algorithmic approach to the satisfactory graph partitioning problem
- Local majorities, coalitions and monopolies in graphs: A review
- Computing global offensive alliances in Cartesian product graphs
- Partitioning a graph into global powerful \(k\)-alliances
- Saturated boundary \(k\)-alliances in graphs
- Security in graphs
- Some bounds on global alliances in trees
- Global offensive alliances in graphs and random graphs
- The alliance partition number of grid graphs
- Global alliances in planar graphs
- Bounds on a graph's security number
- On defensive alliances and line graphs
- Global offensive k-alliance in bipartite graphs
- Connected global offensive k-alliances in graphs
- Trees with equal global offensive k-alliance and k-domination numbers
- Offensive alliances in cubic graphs
- Global offensive alliances in graphs
- Bounds on the global offensive k-alliance number in graphs
- On the global offensive alliance number of a tree
- Bounds concerning the alliance number
- Offensive alliances in graphs
- A survey on alliances and related parameters in graphs
- Global alliances and independence in trees
- Spectral study of alliances in graphs
This page was built for publication: Alliances in graphs: parameters, properties and applications -- a survey
