Degree distance DD(G) = Σ d(v)·D(v) where D(v) = distance sum of vertex v. Vertex-centric version of Schultz index. DD = S (they're the same!). Dobrynin-Kochetova (1994). Clean vertex-centric formulation enables faster computation.
How to Use
Select graph:
- DD: Degree distance
- d·D: Per vertex
- D(v): Dist. sum
Vertex-Centric View
For each vertex v: contribution = d(v)·D(v). Hub with many distant vertices: large contribution. Isolated leaf: small. This formulation reveals which vertices drive the index value.
DD ≡ Schultz
DD(G) = Σ_v d(v)·D(v) = Σ_{i
Step-by-Step Instructions
- 1Select graph.
- 2For each vertex: d(v)·D(v).
- 3Sum contributions.
- 4Identify top contributors.
- 5Compare with Schultz.