Average hopcount of the shortest path in tree-like components with finite size (Q2154398)

From MaRDI portal
Revision as of 02:24, 1 August 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
Average hopcount of the shortest path in tree-like components with finite size
scientific article

    Statements

    Average hopcount of the shortest path in tree-like components with finite size (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 July 2022
    0 references
    random graph
    0 references
    average shortest path
    0 references
    finite component
    0 references
    configuration model
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references