Some \(C_3\)-supermagic graphs (Q2839693)

Assume that a graph \(G\) admits a \(H\)-edge covering, i.e. there exists a family of subgraphs of \(G\) \(H_1,\dots,H_k\), \(H_i\cong H\) for \(i=1,\dots,k\) such that every edge of \(G\) belongs to at least one \(H_i\). Let \(p=|V(G)|\) and \(q=|E(G)|\) and let \(f:V(G)\cup E(G)\rightarrow \{1,\dots p+q\}\) be such a bijection that for every subgraph \(H_i\) we have \(\sum_{v\in V(H)}{f(v)}+\sum_{e\in E(H)}{f(e)}=k\) for some constant \(k\). Then \(f\) is called \(H\)-magic labelling and \(G\) is called \(H\)-magic graph. If \(f(v)\in \{1,\dots p\}\) for every \(v\in V(G)\), then \(f\) is called \(H\)-supermagic labelling and \(G\) is called \(H\)-supermagic graph. The authors prove in a constructive way that generalised antiprisms, triangular ladders and fan graphs are \(C_3\)-supermagic.