Reverse degree distance of unicyclic graphs
Du, Zhibin · Zhou, Bo
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.