Degree resistance distance of unicyclic graphs
Degree resistance distance of unicyclic graphs
复制标题
DOI：
10.22108/toc.2012.1080
复制
发表时间：
2012-06
影响因子：
0.4
通讯作者：
I. Gutman;Linhua Feng;Guihai Yu
中科院分区：
文献类型：
--
作者：
I. Gutman;Linhua Feng;Guihai Yu
设G是一个顶点集为V（G）的连通图. G的度电阻距离定义为：D_R（G）= sum_{{u_v，v} subseteq V（G）} [d（u）+d（v）] R（u，v）$_v，v，在本文中，我们刻画了具有最小和次小度电阻的$n个$-顶点单圈图，
Let $G$ be a connected graph with vertex set $V(G)$. The degree resistance distance of $G$ is defined as $D_R(G) = sum_{{u, v} subseteq V(G)} [d(u)+d(v)] R(u,v)$, where $d(u)$ is the degree of vertex $u$, and $R(u,v)$ denotes the resistance distance between $u$ and $v$. In this paper, we characterize $n$-vertex unicyclic graphs having minimum and second minimum degree resistance distance.