Reciprocal degree distance and graph properties
type: Item
instance of: scholarly article
title: Reciprocal degree distance and graph properties
zbMATH Open document ID: 1415.05041
author: Xianqiang Yang
published in: Discrete Applied Mathematics
publication date: 2019-03-22T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 7040818
zbMATH Keywords: reciprocal degree distance
zbMATH Keywords: degree sequence
zbMATH Keywords: graph properties
reviewed by: G. N. Prasanth
MaRDI profile type: Publication
full work available at URL: j.dam.2018.11.012
OpenAlex ID: W2905147028
cites work: Additively weighted Harary index of some composite graphs
cites work: Best monotone degree conditions for graph properties: a survey
cites work: Q3852212
cites work: Q5576241
cites work: Q3097395
cites work: Wiener index of trees: Theory and applications
cites work: Wiener index, Harary index and graph properties
cites work: Q3807048
cites work: Q4800092
cites work: Q5408286
cites work: On the reciprocal degree distance of graphs
cites work: Degree distance of unicyclic and bicyclic graphs
cites work: Reducibility among Combinatorial Problems
cites work: On the reformulated reciprocal sum-degree distance of graph transformations
cites work: WIENER INDEX ON TRACEABLE AND HAMILTONIAN GRAPHS
cites work: Q5005662
cites work: Reciprocal degree distance of product graphs
cites work: Ordering connected graphs having small degree distances
cites work: Weighted Harary indices of apex trees and \(k\)-apex trees
cites work: Wiener index and traceable graphs
cites work: Calculating the edge Wiener and edge Szeged indices of graphs
Wikidata QID: Q128700070
DOI: 10.1016/J.DAM.2018.11.012
description: scientific article; zbMATH DE number 7040818