Alliance free and alliance cover sets
From MaRDI portal
Publication:2430310
DOI10.1007/S10114-011-0056-1zbMath1248.05142arXivmath/0602428OpenAlexW1981419561WikidataQ57974366 ScholiaQ57974366MaRDI QIDQ2430310
José María Sigarreta-Almira, Sergio Bermudo, Ismael González Yero, Juan Alberto Rodríguez-Velázquez
Publication date: 6 April 2011
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0602428
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioning a graph into defensive \(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
- Defensive \(k\)-alliances in graphs
- On defensive alliances and line graphs
This page was built for publication: Alliance free and alliance cover sets