Reformulated reciprocal degree distance and reciprocal degree distance of the complement of the Mycielskian graph and generalized Mycielskian (Q2298347)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Reformulated reciprocal degree distance and reciprocal degree distance of the complement of the Mycielskian graph and generalized Mycielskian
scientific article

    Statements

    Reformulated reciprocal degree distance and reciprocal degree distance of the complement of the Mycielskian graph and generalized Mycielskian (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 February 2020
    0 references
    Summary: The reformulated reciprocal degree distance is defined for a connected graph \(G\) as \(\overline{R}_t(G) = (1 / 2) \sum_{u, \upsilon \in V \left(G\right)}((d_G(u) + d_G(\upsilon)) /(d_G(u, \upsilon) + t))\), \(t \geq 0\), which can be viewed as a weight version of the \(t \)-Harary index; that is, \( \overline{H}_t(G) = (1 / 2) \sum_{u, \upsilon \in V \left(G\right)}(1 /(d_G(u, \upsilon) + t))\), \(t \geq 0\). In this paper, we present the reciprocal degree distance index of the complement of Mycielskian graph and generalize the corresponding results to the generalized Mycielskian graph.
    0 references
    0 references
    0 references
    0 references