Maximum Detour-Harary index for some graph classes (Q2333908)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Maximum Detour-Harary index for some graph classes
scientific article

    Statements

    Maximum Detour-Harary index for some graph classes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 November 2019
    0 references
    Summary: The definition of a Detour-Harary index is \(\omega H(G) = \frac{1}{2} \sum_{u, v \in V(G)}\frac{1}{l(u, v\vert G)}\), where \(G\) is a simple and connected graph, and \(l(u, v\vert G)\) is equal to the length of the longest path between vertices \(u\) and \(v\). In this paper, we obtained the maximum Detour-Harary index about unicyclic graphs, bicyclic graphs, and cacti, respectively.
    0 references
    Detour-Harary index
    0 references
    maximum
    0 references
    unicyclic
    0 references
    bicyclic
    0 references
    cacti
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references