Transactions on Combinatorics (Dec 2018)
Degree resistance distance of trees with some given parameters
Abstract
The 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.
Keywords