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: | Lau, GC (Author), Ng, HK (Author), Shiu, WC (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
2016
|
Subjects: | |
Online Access: | View Fulltext in Publisher |
Similar Items
-
Further results on super graceful labeling of graphs
by: Lau, G.-C, et al.
Published: (2016) -
Further results on super graceful labeling of graphs
by: Gee-Choon Lau, et al.
Published: (2016-08-01) -
Tight super-edge-graceful labelings of trees and their applications
by: Alex Collins, et al.
Published: (2015-11-01) -
Generating graceful unicyclic graphs from a given forest
by: G. Sethuraman, et al.
Published: (2020-01-01) -
Edge Even Graceful Labeling of Polar Grid Graphs
by: Salama Nagy Daoud
Published: (2019-01-01)