An upper bound on the cover time for powers of graphs (Q1579561): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q127976952, #quickstatements; #temporary_batch_1724809781087 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127976952 / rank | |||
Normal rank | |||
Latest revision as of 02:54, 28 August 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound on the cover time for powers of graphs |
scientific article |
Statements
An upper bound on the cover time for powers of graphs (English)
0 references
14 September 2000
0 references
cover time
0 references
random walk
0 references
Cartesian product graph
0 references
upper bound
0 references
