Abstract
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 language | English |
---|---|
Pages (from-to) | 1621-1628 |
Number of pages | 8 |
Journal | Acta Mathematica Sinica, English Series |
Volume | 22 |
Issue number | 6 |
Early online date | 16 May 2006 |
DOIs | |
Publication status | Published - Nov 2006 |
Scopus Subject Areas
- General Mathematics
- Applied Mathematics
User-Defined Keywords
- super–edge–graceful
- cubic graph
- permutation cubic graph
- permutation Petersen graph
- permutation ladder graph