Partitioning a graph into defensive \(k\)-alliances (Q546272): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: Wikidata QID (P12): Q57974377, #quickstatements; #temporary_batch_1719448105926 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57974377 / rank | |||
Normal rank | |||
Revision as of 02:30, 27 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning a graph into defensive \(k\)-alliances |
scientific article |
Statements
Partitioning a graph into defensive \(k\)-alliances (English)
0 references
24 June 2011
0 references
defensive alliances
0 references
dominating sets
0 references
domination
0 references
isoperimetric number
0 references
