Further results on super graceful labeling of graphs
Let G=(V(G),E(G)) be a simple, finite and undirected graph of order p and size q. A bijection f:V(G)∪E(G)→{k,k+1,k+2,…,k+p+q−1} such that f(uv)=|f(u)−f(v)| for every edge uv∈E(G) is said to be a k-super graceful labeling of G. We say G is k-super graceful if it admits a k-super graceful labeling. Fo...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Kalasalingam University
2016
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher View in Scopus |