Partitioning a graph into global powerful \(k\)-alliances (Q1926038)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Partitioning a graph into global powerful k-alliances |
scientific article; zbMATH DE number 6118551
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning a graph into global powerful \(k\)-alliances |
scientific article; zbMATH DE number 6118551 |
Statements
Partitioning a graph into global powerful \(k\)-alliances (English)
0 references
27 December 2012
0 references
defensive \(k\)-alliances
0 references
offensive \(k\)-alliances
0 references
powerful \(k\)-alliances
0 references
Cartesian product graphs
0 references
0.9187029004096984
0 references
0.8948565721511841
0 references
0.8934494853019714
0 references
0.8634428381919861
0 references
0.8386494517326355
0 references
