On the reciprocal degree distance of graphs with cut vertices or edges
Xiao-Xin Li
TL;DR
This paper characterizes extremal graphs with maximum reciprocal degree distance (RRD) among graphs with specified cut vertices or edges and provides bounds based on the number of cut edges.
Contribution
It identifies extremal graphs for RRD with given cut vertices or edges and establishes upper bounds related to cut edges.
Findings
Identified extremal graphs with maximum RRD for given cut vertices or edges.
Provided upper bounds on RRD based on the number of cut edges.
Characterized the structure of graphs maximizing RRD under these conditions.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Graph Labeling and Dimension Problems · Limits and Structures in Graph Theory