Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\) (Q468433)
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: Almost all k-cop-win graphs contain a dominating set of cardinality k |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\) |
scientific article |
Statements
Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\) (English)
0 references
7 November 2014
0 references
\(k\)-cop-win graph
0 references
random graphs
0 references
0.8734170794487
0 references
0.7553824186325073
0 references
0.7548084855079651
0 references
0.7544581294059753
0 references
