The non-edge-magic simple connected cubic graph of order 10

Wai Chee SHIU*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

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 languageEnglish
Pages (from-to)225-241
Number of pages17
JournalJournal of Combinatorial Mathematics and Combinatorial Computing
Volume83
Publication statusPublished - Nov 2012

Scopus Subject Areas

  • Mathematics(all)

User-Defined Keywords

  • Cubic graph
  • Edge-magic

Fingerprint

Dive into the research topics of 'The non-edge-magic simple connected cubic graph of order 10'. Together they form a unique fingerprint.

Cite this