TY - JOUR
ID - 437
TI - On reverse degree distance of unicyclic graphs
JO - Bulletin of the Iranian Mathematical Society
JA - BIMS
LA - en
SN - 1017-060X
AU - Du, Z.
AU - Zhou, B.
AD - Northeast Normal University
Y1 - 2013
PY - 2013
VL - 39
IS - 4
SP - 681
EP - 706
KW - reverse degree distance
KW - diameter
KW - pendant vertices
KW - maximum degree
KW - unicyclic graphs
DO -
N2 - The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the vertex set of $G$. We determine the unicyclic graphs of given girth, number of pendant vertices and maximum degree, respectively, with maximum reverse degree distances. We also determine the unicyclic graphs of given number of vertices, girth and diameter with minimum degree distance.
UR - http://bims.iranjournals.ir/article_437.html
L1 - http://bims.iranjournals.ir/article_437_7a694edd090f25ab56c01b6e0653732b.pdf
ER -