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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 03:03, 1 February 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