Published December 18, 2012 | Version v1
Journal article Open

On the Odd Gracefulness of Cyclic Snakes With Pendant Edges

Creators

  • 1. Department of Scientific Computing, Faculty of Computer Science and Informatics, Benha University, Benha, Egypt

Description

Graceful and odd gracefulness of a graph are two entirely different concepts. A graph may posses one or both of these or neither. We present four new families of odd graceful graphs. In particular we show an odd graceful labeling of the linear 4 1 kC snake mK − e and therefore we introduce the odd graceful labeling of 4 1 kC snake mK − e ( for the general case ). We prove that the subdivision of linear 3 kC snake − is odd graceful. We also prove that the subdivision of linear 3 kC snake − with m-pendant edges is odd graceful. Finally, we present an odd graceful labeling of the crown graph P mK n 1 e .

Files

4412jgraph01.pdf

Files (200.5 kB)

Name Size Download all
md5:56f955cd39cf860a2ad53ea8a56188c4
200.5 kB Preview Download