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) = vertical bar f(u) - f(v)vertical bar for every edge uv is an element of E(G) is said to be a k-super graceful labeling of G....
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2016
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |