The graphs with a given number n of vertices and given (vertex or edge) connectivity k, having minimum Wiener index are determined. In both cases this is Kk + (K₁ + U Kn-k-1), the graph obtained by ...

All products featured on WIRED are independently selected by our editors. However, we may receive compensation from retailers and/or from purchases of products through these links. Learn more. One of ...