On the reciprocal degree distance of graphs with cut vertices or edges
classification
🧮 math.CO
keywords
edgesdegreedistancegraphsreciprocalverticesadditionbounds
read the original abstract
In this paper, the extremal graph with the maximum RRD-value among all the graphs of order n with given cut vertices or edges is characterized. In addition, an upper bounds on the reciprocal degree distance in terms of the number of cut edges is provided.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.