Given the sum of weights of shortest paths between all vertices in a graph, how can I construct a connected graph that satisfies the given sum? That is, how can a graph with a given wiener index be created?
Construction of graph with given Wiener Index
algorithms;graph theory;graphs