Contents

On \(k\)-Edge-Magic Cubic Graphs

Sin-Min Lee1, Hsin-Hao Su2, Yung-Chin Wang3
1Dept. of Computer Science, 208 MacQuarrie Hall San Jose State Univ., San Jose, CA 95192, USA
2Dept. of Mathematics, Stonehill College 320 Washington St, Easton, MA 02357, USA
3Dept. of Digital Media Design, Tzu-Hui Inst. of Tech. No.367, Sanmin Rd. Nanjhou Hsian, Pingtung, 926, Taiwan

Abstract

Let \( G \) be a \((p,q)\)-graph in which the edges are labeled \( k, k+1, \ldots, k+q-1 \), where \( k \geq 0 \). The vertex sum for a vertex \( v \) is the sum of the labels of the incident edges at \( v \). If the vertex sums are constant, modulo \( p \), then \( G \) is said to be \( k \)-edge-magic. In this paper, we investigate some classes of cubic graphs which are \( k \)-edge-magic. We also provide a counterexample to a conjecture that any cubic graph of order \( p \equiv 2 \pmod{4} \) is \( k \)-edge-magic for all \( k \).