Zhibin Du, Bo Zhou
Published 2011-07-12Version 1
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.
On bipartite graphs of defect at most 4
On graphs of defect at most 2
A proof of the conjecture on hypoenergetic graphs with maximum degree $Δ\leq 3$
![QR code for arXiv:1107.2171 [math.CO]](http://oss.arxitics.com/images/favicon.svg)