Reciprocal degree distance and graph properties (Q1732091)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Reciprocal degree distance and graph properties
scientific article

    Statements

    Reciprocal degree distance and graph properties (English)
    0 references
    0 references
    22 March 2019
    0 references
    The reciprocal degree distance (RDD), defined for a connected graph $G$ as vertex-degree- weighted sum of the reciprocal distances, that is, $\displaystyle{\mathrm{RDD}(G) = \sum_{u\neq v}\frac{d_G(u)+d_G(v)}{d_G (u,v)} }$ , where $d_G(u)$ is the degree of the vertex $u$ in the graph $G$ and $d_G(u,v)$ denotes the distance between two vertices $u$ and $v$ in the graph $G$. In this paper, the authors give sufficient conditions for a graph to be $k$-connected or $\beta$-deficient in terms of the reciprocal degree distance.
    0 references
    reciprocal degree distance
    0 references
    degree sequence
    0 references
    graph properties
    0 references

    Identifiers