3 problems

Sum-diameter conjecture for paths. For $n\geq 3$, we have

Spum conjecture for paths. For $n\geq 8$, we have

Let $\epsilon(G)$ denote the exclusive sum number of a graph: the least $r$ such that $G$ together with $r$ isolated vertices has an exclusive sum labelling, meaning that the only…