Cycle-magic graphs (Q2462363): Difference between revisions

Given a cycle \(C\), a graph \(G=(V,E)\) that admits a \(C\)-covering is said to be \(C\)-magic if there exists a total labeling \(f: V\cup E \to \{1,2,\dots,|V|+|E|\}\) such that, for every subgraph \(H'=(V',E')\) of \(G\) isomorphic to \(C\), \(\sum_{v\in V'} f(v)+\sum_{e\in E'} f(e)\) is constant. When \(f(V)=\{1,\dots,|V|\}\), \(G\) is said to be \(C\)-supermagic. The authors study the cyclic-magic and cyclic-supermagic behavior of several classes of connected graphs. For example, they prove that the wheel \(W_n\) is \(C_3\)-supermagic if \(n\geq 5\) is odd. Also, windmills \(W(r,k)\) (for \(k\geq 2\), \(r\geq 3\)) are \(C_r\)-supermagic. As a different kind of result, they prove that if \(G\) is a \(C_4\)-free supermagic graph of odd size, then \(G\times K_2\) is \(C_4\)-supermagic.