Offensive \(r\)-alliances in graphs
DOI10.1016/j.dam.2008.06.001zbMath1200.05157DBLPjournals/dam/FernauRS09arXivmath/0703598OpenAlexW2072894899WikidataQ57974438 ScholiaQ57974438MaRDI QIDQ1003773
Henning Fernau, Juan Ángel Rodríguez, José María Sigarreta-Almira
Publication date: 4 March 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0703598
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (19)
Cites Work
- On the global offensive alliance number of a graph
- Global defensive alliances in graphs
- Global alliances in planar graphs
- On defensive alliances and line graphs
- Global offensive alliances in graphs
- An upper bound for thek-domination number of a graph
- Offensive alliances in graphs
- Global alliances and independence in trees
- Spectral study of alliances in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Offensive \(r\)-alliances in graphs