Reciprocal degree distance of some graph operations
The reciprocal degree distance (RDD), defined for a connected graph G as vertex-degreeweighted sum of the reciprocal distances, that is, RDD(G) = u,v∈PV(G) dG(u)+dG(v) dG(u,v) . The reciprocal degree distance is a weight version of the Harary index, just as the degree distance is a weight version of...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2013-02-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | http://www.combinatorics.ir/?_action=showPDF&article=3506&_ob=bfc02f2003611e70f89d3bbb16913cd1&fileName=full_text.pdf. |