Distance-related invariants on polygraphs
A fasciagraph (rotagraph) is obtained as \(n\) copies of a fixed base graph, sequentially linked in a linear (circular) way through a fixed set of vertex-pairs of the base graph. Tight bounds are derived on the distance matrix of a fasciagraph (rotagraph) in terms of the base graph's distance matrix. This allows approximation of the Wiener index (total distance sum of all pairs) of a fasciagraph (rotagraph), exact in several important cases.
scientific article; zbMATH DE number 1109900