On k-super graceful labeling of graphs

zbMATH Open1496.05163arXiv1807.01203MaRDI QIDQ5041950FDOQ5041950

Authors: Gee-Choon Lau, Wai Chee Shiu, Ho Kuen Ng 

Publication date: 18 October 2022

Abstract: Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $p$ and size $q$. For $kge1$, a bijection $f:V(G)cupE(G)ok,k+1,k+2,ldots,k+p+q-1$ such that $f(uv)=|f(u)-f(v)|$ for every edge $uvinE(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. 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.

Full work available at URL: https://arxiv.org/abs/1807.01203

Recommendations

• Further results on super graceful labeling of graphs
• Super edge-graceful labelings of complete tripartite graphs
• Super edge-graceful labelings of complete bipartite graphs
• Super edge-gracefulness of complete graphs
• scientific article; zbMATH DE number 6810351

zbMATH Keywords

graceful labeling\(k\)-super graceful labelingbipartite and tripartite graphs

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Graph theory with applications
• Title not available (Why is that?)
• Further results on super graceful labeling of graphs
• On k-sequential and other numbered graphs

Cited In (9)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On (super) vertex-graceful labeling of graphs.
• Title not available (Why is that?)
• Further results on super graceful labeling of graphs
• On the gracefulness of m-super subdivision of graphs
• Title not available (Why is that?)
• Super edge-graceful labelings of complete bipartite graphs
• Super edge-graceful labelings of complete tripartite graphs

This page was built for publication: On \(k\)-super graceful labeling of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041950)