The local antimagic chromatic number conjecture for joins of matching and null graphs

Let $r,s\ge 1$ and $m\ge 2$. For a graph $G$, its local antimagic chromatic number $\chi_{la}(G)$ is the least number of distinct induced vertex labels among bijective local antimagic edge labelings of $G$. Let $(2s+1)P_2$ be the disjoint union of $2s+1$ copies of the two-vertex path, let $O_m$ be the null graph on $m$ vertices, let $\vee$ denote the graph join, and let $2r((2s+1)P_2\vee O_m)$ be the disjoint union of $2r$ copies of this join.

Local antimagic chromatic number conjecture.

$$\chi_{la}\bigl(2r((2s+1)P_2\vee O_m)\bigr)=3.$$

This is posed as an open problem in the conclusion, extending results on local antimagic chromatic numbers for joins of special graph families. The claim predicts a constant value of $3$ throughout the stated parameter range.