The communicability distance in graphs (Q414715)

From MaRDI portal
Revision as of 20:21, 29 June 2023 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
The communicability distance in graphs
scientific article

    Statements

    The communicability distance in graphs (English)
    0 references
    0 references
    11 May 2012
    0 references
    This paper discusses communicability distance on a Euclidean distance and gives explanations for paths, cycles, stars and complete graphs on \(n\)-nodes. A new graph invariant, the sum of all communicability distances in graphs, is introduced and compared with standard invariant Wiener and Kirchhoff indices of graphs
    0 references
    Euclidean distance
    0 references
    communicability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references