In 2003, Lee, Wang and Wen found a non-edge-magic simple connected cubic graph which satisfying the necessary condition of edgemagicness by using computer search. They asked for a mathematical proof. In this paper, we will provide such a proof.
|Number of pages||17|
|Journal||Journal of Combinatorial Mathematics and Combinatorial Computing|
|Publication status||Published - Nov 2012|
Scopus Subject Areas
- Cubic graph