Partitioning a graph into offensive \(k\)-alliances (Q629362)
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 offensive k-alliances |
scientific article; zbMATH DE number 5862858
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning a graph into offensive \(k\)-alliances |
scientific article; zbMATH DE number 5862858 |
Statements
Partitioning a graph into offensive \(k\)-alliances (English)
0 references
9 March 2011
0 references
offensive alliances
0 references
dominating sets
0 references
domination number
0 references
chromatic number
0 references
0.8970606923103333
0 references
0.8934494853019714
0 references
0.8767003417015076
0 references
0.8626618981361389
0 references
0.8550185561180115
0 references
