If k > 0, the vertex is a minimum turning point If k < 0, the vertex is a maximum turning point We can identify these properties from a quadratics graph or equation.

The generalized vertex median of a weighted graph may be found by complete enumeration or by some heuristic method. This paper investigates alternatives and proposes a method that seems to perform ...

We apply our new method both to edge- and to vertex-reinforced random walks with super-linear reinforcement on arbitrary infinite connected graphs of bounded degree. We stress that, unlike all ...