While such problems are convex, existing methods cannot guarantee that solutions will have specific graph topology properties (e.g., being a tree), which are desirable for some applications. The ...

Abstract: A labeling of a plane graph is called super d-antimagic if the vertices receive the smallest labels and the weight set of all faces in an arithematic progression with difference d, where ...