University of IsfahanTransactions on Combinatorics2251-86577420181201Degree resistance distance of trees with some given parameters11242287610.22108/toc.2018.108656.1538ENFangguoHeCollege of Mathematics and Physics, Huanggang Normal University, Huanggang, ChinaXinnongJiangCollege of Life Science and Techonolgy, Huazhong University of Science and Technology, WuhanJournal Article20171218The degree resistance distance of a graph $G$ is defined as $D_R(G)=\sum_{i<j}(d(v_i)+d(v_j))R(v_i,v_j)$, where $d(v_i)$ is the degree of the vertex $v_i$, and $R(v_i,v_j)$ is the resistance distance between the vertices $v_i$ and $v_j$. Here we characterize the extremal graphs with respect to degree resistance distance among trees with given diameter, number of pendent vertices, independence number, covering number, and maximum degree, respectively.https://toc.ui.ac.ir/article_22876_656cf5d3e08fe0f15a55536167cbc556.pdf