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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
