Super–edge–graceful Labelings of Some Cubic Graphs

Wai Chee Shiu*

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

6 Citations (Scopus)
42 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
Early online date16 May 2006
Publication statusPublished - Nov 2006

Scopus Subject Areas

  • Mathematics(all)
  • Applied Mathematics

User-Defined Keywords

  • super–edge–graceful
  • cubic graph
  • permutation cubic graph
  • permutation Petersen graph
  • permutation ladder graph


Dive into the research topics of 'Super–edge–graceful Labelings of Some Cubic Graphs'. Together they form a unique fingerprint.

Cite this