An upper bound on the cover time for powers of graphs (Q1579561): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q127976952, #quickstatements; #temporary_batch_1724809781087
 
Property / Wikidata QID
 
Property / Wikidata QID: Q127976952 / rank
 
Normal rank

Latest revision as of 03: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
    0 references
    14 September 2000
    0 references
    0 references
    0 references
    0 references
    0 references
    cover time
    0 references
    random walk
    0 references
    Cartesian product graph
    0 references
    upper bound
    0 references
    0 references