Reverse degree distance of unicyclic graphs
Combinatorics
2011-07-13 v1
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.
Keywords
Cite
@article{arxiv.1107.2171,
title = {Reverse degree distance of unicyclic graphs},
author = {Zhibin Du and Bo Zhou},
journal= {arXiv preprint arXiv:1107.2171},
year = {2011}
}