On the complexity of \(k\)-metric antidimension problem and the size of \(k\)-antiresolving sets in random graphs (Q2412436)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of \(k\)-metric antidimension problem and the size of \(k\)-antiresolving sets in random graphs |
scientific article |
Statements
On the complexity of \(k\)-metric antidimension problem and the size of \(k\)-antiresolving sets in random graphs (English)
0 references
23 October 2017
0 references
