An upper bound on the cover time for powers of graphs (Q1579561)

From MaRDI portal
Revision as of 00:30, 23 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    cover time
    0 references
    random walk
    0 references
    Cartesian product graph
    0 references
    upper bound
    0 references

    Identifiers