2 problems

Let $G=(V,E)$ be a finite connected graph with no isolated vertices, and let $f:E\to\{1,2,\ldots,|E|\}$ be a bijection. For each vertex $u\in V$, define its weight by … where…

Let $P_n$ be the path of order $n\geq 2$, and let $\chi_{lat}(P_n)$ denote its local antimagic total chromatic number. Odd-path conjecture. For odd $n\geq 3$, … The source verifies…