@article {
author = {Gutman, Ivan and Feng, Linhua and Yu, Guihai},
title = {Degree resistance distance of unicyclic graphs},
journal = {Transactions on Combinatorics},
volume = {1},
number = {2},
pages = {27-40},
year = {2012},
publisher = {University of Isfahan},
issn = {2251-8657},
eissn = {2251-8665},
doi = {10.22108/toc.2012.1080},
abstract = {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. },
keywords = {Resistance distance (in graph),Degree distance,Degree resistance distance},
url = {https://toc.ui.ac.ir/article_1080.html},
eprint = {https://toc.ui.ac.ir/article_1080_cb45bc3cac05fe499d71eb2ac6e5ec20.pdf}
}