Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 225-241 |
| Number of pages | 17 |
| Journal | Journal of Combinatorial Mathematics and Combinatorial Computing |
| Volume | 83 |
| Publication status | Published - Nov 2012 |
Scopus Subject Areas
- Mathematics(all)
User-Defined Keywords
- Cubic graph
- Edge-magic