The inverse problem for the Steiner--Wiener index via additive number theory
We show that, for any given $k \ge 2$, every sufficiently large number appears as the Steiner--Wiener $k$ index of a graph.
math.CO↗
arXiv subjects
Publications and source records attributed to Joshua Shaw.
We show that, for any given $k \ge 2$, every sufficiently large number appears as the Steiner--Wiener $k$ index of a graph.