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 ...

One of my favorite quick blogs to read is Indexed, done by Jessica Hagy. Venn diagrams being one of my favorite things ever, this blog captured my attention and my heart instantly. And now most ...