Super-edge-graceful labelings of some cubic graphs

Wai Chee SHIU*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)
5 Downloads (Pure)


The notion of super-edge-graceful graphs was introduced by Mitchem and Simoson in 1994. However, few examples except trees are known. In this paper, we exhibit two classes of infinitely many cubic graphs which are super-edge-graceful. A conjecture is proposed.

Original languageEnglish
Pages (from-to)1621-1628
Number of pages8
JournalActa Mathematica Sinica, English Series
Issue number6
Publication statusPublished - Nov 2006

Scopus Subject Areas

  • Mathematics(all)
  • Applied Mathematics

User-Defined Keywords

  • Cubic graph
  • Permutation cubic graph
  • Permutation ladder graph
  • Permutation Petersen graph
  • Super-edge-graceful


Dive into the research topics of 'Super-edge-graceful labelings of some cubic graphs'. Together they form a unique fingerprint.

Cite this