Saturated boundary \(k\)-alliances in graphs
From MaRDI portal
Publication:2341725
DOI10.1016/j.dam.2014.11.030zbMath1311.05155OpenAlexW2029832225MaRDI QIDQ2341725
Hamamache Kheddouci, Hachem Slimani
Publication date: 28 April 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.11.030
boundary defensive (-1)-allianceboundary offensive 1-allianceboundary powerful (-1)-allianceminimal (connected) global boundary powerful (-1)-alliancesaturated boundary \(k\)-alliancesaturated vertex
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distinctive power of the alliance polynomial for regular graphs
- Global defensive alliances of trees and Cartesian product of paths and cycles
- Partitioning a graph into defensive \(k\)-alliances
- Partitioning a graph into offensive \(k\)-alliances
- 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
- Powerful alliances in graphs
- Global defensive alliances in star graphs
- Defensive \(k\)-alliances in graphs
- Global defensive alliances in graphs
- Partitioning a graph into global powerful \(k\)-alliances
- Global alliances in planar graphs
- On defensive alliances and line graphs
- Global offensive alliances in graphs
- Offensive alliances in graphs
- A survey on alliances and related parameters in graphs
