Reverse degree distance of unicyclic graphs
Zhibin Du, Bo Zhou
TL;DR
This paper investigates the reverse degree distance in unicyclic graphs, identifying those with maximum reverse degree distances given constraints like girth, pendant vertices, and maximum degree.
Contribution
It determines the unicyclic graphs with maximum reverse degree distances under various structural constraints, advancing understanding of this graph invariant.
Findings
Identifies unicyclic graphs with maximum reverse degree distance for fixed girth.
Identifies unicyclic graphs with maximum reverse degree distance for fixed pendant vertices.
Identifies unicyclic graphs with maximum reverse degree distance for fixed maximum degree.
Abstract
The reverse degree distance is a connected graph invariant closely related to the degree distance proposed in mathematical chemistry. We determine the unicyclic graphs of given girth, number of pendant vertices and maximum degree, respectively, with maximum reverse degree distances.
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 · Advanced Graph Theory Research