Partitioning a graph into defensive \(k\)-alliances
From MaRDI portal
Publication:546272
DOI10.1007/s10114-011-9075-1zbMath1222.05206arXiv0901.4923OpenAlexW2103213531WikidataQ57974377 ScholiaQ57974377MaRDI QIDQ546272
Sergio Bermudo, Ismael González Yero, Juan Alberto Rodríguez-Velázquez, José María Sigarreta-Almira
Publication date: 24 June 2011
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0901.4923
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
On global offensive \(k\)-alliances in graphs ⋮ Partitioning a graph into global powerful \(k\)-alliances ⋮ Global defensive alliances in the lexicographic product of paths and cycles ⋮ Alliance free and alliance cover sets ⋮ Alliances in graphs: parameters, properties and applications -- a survey ⋮ Alliance free sets in Cartesian product graphs ⋮ Distribution of global defensive \(k\)-alliances over some graph products ⋮ Alliances and Related Domination Parameters ⋮ Saturated boundary \(k\)-alliances in graphs
Cites Work
- Global defensive \(k\)-alliances in graphs
- On the global offensive alliance number of a graph
- Offensive \(r\)-alliances in graphs
- Powerful alliances in graphs
- On the complement graph and defensive \(k\)-alliances
- Defensive \(k\)-alliances in graphs
- Global defensive alliances in graphs
- Isoperimetric numbers of graph bundles
- The alliance partition number of grid graphs
- Global alliances in planar graphs
- On defensive alliances and line graphs
- Isoperimetric numbers of graphs
- Isoperimetric Inequalities and Eigenvalues
- Offensive alliances in graphs
- A survey of graph laplacians
- 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
