Szeged Index Calculator

distance-partitioning index

All Tools

Loading tool...

About Szeged Index Calculator

A Szeged index calculator computing Sz(G) = Σ_{e=(i,j)} n_i(e)·n_j(e) where n_i(e) = vertices closer to i than j. Gutman (1994). Generalization of Wiener index for non-trees. Sz ≥ W always. Sz = W iff bipartite. Client-side.

Szeged Index Calculator Features

  • Sz(G)
  • nᵢ·nⱼ
  • ≥ Wiener
  • Bipartite
  • Common graphs
Advertisement
Advertisement