Results 11 to 20 of about 209,693 (137)

m-Bonacci graceful labeling [PDF]

AKCE International Journal of Graphs and Combinatorics, 2021
We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci graceful if the vertices can be labeled with distinct integers from the set such that the derived edge labels are the first n m-bonacci numbers.
Kalpana Mahalingam, Helda Princy Rajendran   +1 more
doaj   +3 more sources

Further results on super graceful labeling of graphs [PDF]

AKCE International Journal of Graphs and Combinatorics, 2016
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)=|f(u)−f(v)| for every edge uv∈E(G) is said to be a k-super graceful labeling of G.
Wai Chee Shiu, Gee Choon Lau
exaly   +4 more sources

Edge Odd Graceful Labeling in Some Wheel-Related Graphs

Mathematics
A graph’s edge labeling involves the allocation of symbols (colors or numbers) to the edges of a graph governed by specific criteria. Such labeling of a graph G with order n and size m is named edge odd graceful if there is a bijective map φ from the set
S N Daoud, Mohammed Aljohani
exaly   +4 more sources

Graceful Labeling and Skolem Graceful Labeling on the U-star Graph and It’s Application in Cryptography [PDF]

Jambura Journal of Mathematics, 2021
Graceful Labeling on graph G=(V, E) is an injective function f from the set of the vertex V(G) to the set of numbers {0,1,2,...,|E(G)|} which induces bijective function f from the set of edges E(G) to the set of numbers {1,2,...,|E(G)|} such that for ...
Meliana Pasaribu, Yundari Yundari, Muhammad Ilyas   +2 more
doaj   +2 more sources

The Edge Odd Graceful Labeling of Water Wheel Graphs

Axioms
A graph, G=(V,E), is edge odd graceful if it possesses edge odd graceful labeling. This labeling is defined as a bijection g:E(G)→{1,3,…,2m−1}, from which an injective transformation is derived, g*:V(G)→{1,2,3,…,2m−1}, from the rule that the image of u∈V(
S N Daoud, Mohammed Aljohani
exaly   +4 more sources

Gaussian Tribonacci R-Graceful Labeling of Some Tree Related Graphs [PDF]

Ratio Mathematica, 2022
Let r be any natural number. An injective function , where  is the Gaussian Tribonacci number in the Gaussian Tribonacci sequence is said to be Gaussian Tribonacci r-graceful labeling if the induced edge labeling such that  is bijective.
K Sunitha, M Sheriba
doaj   +2 more sources

Extending of Edge Even Graceful Labeling of Graphs to Strong r-Edge Even Graceful Labeling

Journal of Mathematics, 2021
Edge even graceful labeling of a graph G with p vertices and q edges is a bijective f from the set of edge EG to the set of positive integers 2,4,…,2q such that all the vertex labels f∗VG, given by f∗u=∑uv∈EGfuvmod2k, where k=maxp,q, are pairwise ...
Mohamed R. Zeen El Deen, Nora A. Omar
doaj   +2 more sources

Graceful labeling of digraphs—a survey [PDF]

AKCE International Journal of Graphs and Combinatorics, 2021
A digraph D with p vertices and q arcs is labeled by assigning a distinct integer value g(v) from to each vertex v. The vertex values, in turn, induce a value g(u, v) on each arc (u, v) where g(u, v) = (g(v) − g(u)) (mod q + 1) If the arc values are all ...
Shivarajkumar, M. A. Sriraj, S. M. Hegde
doaj   +3 more sources

Graceful Labeling of Spider Graphs With at Most Five Legs

Journal of Applied Mathematics
A graceful labeling of a graph G with q edges is an injection f from the vertices of G to the set 0,1,⋯,q such that, when each edge uv is assigned the label fu−fv, the resulting edge labels are distinct.
Apichai Panpa
exaly   +3 more sources

Radio Graceful Labelling of Graphs

Theory and Applications of Graphs, 2020
Radio labelling problem of graphs have their roots in communication problem known as \emph{Channel Assignment Problem}. For a simple connected graph $G=(V(G), E(G))$, a radio labeling is a mapping $f \colon V(G)\rightarrow \{0,1,2,\ldots\}$ such that $|f(
Laxman Saha, Alamgir Basunia
doaj   +5 more sources