Super Graceful Labeling for Some Simple Graphs

Perumal, M. A.; Navaneethakrishnan, S.; Nagarajan, A.; Arockiaraj, S.

doi:10.26708/ijmsc.2012.1.2.05

Cited by 3 publications

(3 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Using a similar approach, we can also show that C 8 is not 4-super graceful. However, C 8 is 2-super graceful with consecutive vertex labels 17, 4,14,12,15,7,16,11. The corresponding edge labels are 13,10,2,3,8,9,5,6.…”

Section: Proof Formentioning

confidence: 99%

“…However, C 8 is 2-super graceful with consecutive vertex labels 17, 4,14,12,15,7,16,11. The corresponding edge labels are 13,10,2,3,8,9,5,6. Deleting the edge with label 2, we have another 3-super graceful labeling for P 8 .…”

Section: Proof Formentioning

confidence: 99%

“…for every edge uv in G. We say G is k-super graceful if it admits a k-super graceful labeling. This is a generalization of super graceful labeling defined in [6,7]. For simplicity, 1-super graceful is also known as super graceful.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

On $k$-Super Graceful Labeling of Graphs

Lau¹,

Shiu²,

Ng³

2018

Preprint

View full text Add to dashboard Cite

Let G = (V (G), E(G)) be a simple, finite and undirected graph of order p and size q.We say G is k-super graceful if it admits a k-super graceful labeling. In this paper, we study the k-super gracefulness of some standard graphs. Some general properties are obtained. Particularly, we found many sufficient conditions on k-super gracefulness for many families of (complete) bipartite and tripartite graphs. We show that some of the conditions are also necessary.

show abstract