Year: 2026
Type: article
Abstract: Let \(G=(V(G),E(G))\) be a simple, finite and undirected graph of order \(p\) and size \(q\). For \(k\ge 1\), a bijection \(f: V(G)\cup E(G) \to \{k, k+1, k+2, \ldots, k+p+q-1\}\) such that \(f(uv)= |f(u) - f(v)|\) for every edge \(uv\in E(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 complete multi-partite graphs.
DOI: 10.61091/jcmcc131-21
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W7204864020