Solution of the conjecture: if \(n\equiv 0 \pmod 4\), \(n>4\), then \(K_n\) has a super vertex-magic total labeling (Q2455579): Difference between revisions

Let \(G= (V, E)\) be an undirected graph with \(|V|= n\) and \(|E|= e\), and let \(N(v)\) denote the set of neighbors of vertex \(v\in V\). A total labeling of \(G\) is a bijection \(\lambda: V\cup E\to [1,2,\dots, n+ e]\) and the associated weight of vertex \(v\) is \[ w_\lambda(v_i)= \lambda(v_i)+ \sum_{v_j\in N(v_i)} \lambda(v_i, v_j). \] If \(w_\lambda(v_i)= h\) for each \(i\), then the total labeling \(\lambda\) of \(G\) is called vertex-magic. The set of possible values of \(h\) has upper and lower bounds, and any \(h\) between these bounds is called a feasible value for \(h\). If \(\lambda(V)= [1,2,\dots, n]\) then the vertex-magic total labeling (VMTL) is called a super VMTL (SVMTL). It is shown here that \(K_n\) has a SVMTL for all \(n\equiv 0\pmod 4\), \(n> 4\). It is done by proposing a new method to obtain a SVMTL, and then applying this method to \(K_{4l-1}\) \((l> 1)\), obtaining a SVMTL for \(K_{4l}\) \((l> 1)\).