On k-super graceful graphs with extremal maximum vertex degree
Gee-Choon Lau, Wai Chee Shiu, Ho-Kuen Ng, Zhen-Bin Gao, Karl Schaffer
In this paper: Let G(V, E) be a simple and loopless graph with |V| vertices and |E| edges. For k ≥ 1, a graph G is called k-super graceful if there is a bijective labeling f : V ∪ E → {i | k ≤ i ≤ k + |V| + |E| –...
