“…In an independent work [2], Aliniaeifard, Wang and van Willigenburg obtained results similar to the ones presented in this section, but written completely in the language of symmetric functions. A 2-pointed vertex-weighted graph is a tuple (G, w, s, t), where (G, w) is a vertexweighted graph, and s and t are (possibly the same) vertices of G. When w, s, and t are clear, we will often just write G in a slight abuse of notation.…”