Degree resistance distance of unicyclic graphs
Let G be a connected graph with vertex set V(G). The degree resistance distance of G is defined as the sum over all pairs of vertices of the terms [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-ve...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2012-06-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | http://www.combinatorics.ir/?_action=showPDF&article=1080&_ob=cb45bc3cac05fe499d71eb2ac6e5ec20&fileName=full_text.pdf |