Wiener indices of hex carpets---from hexagon models to square grids (Q1907265)

Let \(d\) be the distance function of a connected graph \(G= (V, E)\). Harold Wiener introduced the following characteristic of \(G\): \[ {\mathcal W}(G):= \sum_{\{u, v\}\subset V} d(u, v). \] Now this characteristic is usually called Wiener index (some other names are also used). The paper is devoted to Wiener indices of so-called hex carpets, that is graphs which in a natural way correspond to ``nice'' parts of the standard hexagonal tiling of the plane.