The graph bottleneck identity (Q719327)

From MaRDI portal
Revision as of 11:49, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The graph bottleneck identity
scientific article

    Statements

    title
    The graph bottleneck identity (English)
    0 references
    publication date
    10 October 2011
    0 references
    zbMATH Keywords
    graph distances
    0 references
    matrix forest theorem
    0 references
    vertex
    0 references
    vertex proximity
    0 references
    spanning converging forest
    0 references
    transitional measure
    0 references
    graph bottleneck identity
    0 references
    regularized Laplacian kernel
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C12
    0 references
    05C50
    0 references
    05C20
    0 references
    zbMATH DE Number
    5955930
    0 references
    OpenAlex ID
    W1626832437
    0 references
    arXiv ID
    1003.3904
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q719327&oldid=35247662"
    Powered by MediaWiki