Results 1 to 10 of about 219,967 (286)
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 +1 more
doaj +3 more sources
The Edge Odd Graceful Labeling of Water Wheel Graphs
AxiomsA 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(
Salama Nagy Daoud
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 +2 more
doaj +2 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
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
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
Computer search for graceful labeling: a survey
Electronic Journal of Graph Theory and Applications, 2022 This paper surveys the main computer search results for finding graceful labeling of trees. The paper is devoted to the memory of Mirka Miller, who made an outstanding contribution to the area of graph labeling.
Ljiljana Brankovic, Michael J. Reynolds
doaj +3 more sources
Edge Odd Graceful Labeling in Some Wheel-Related Graphs
MathematicsA 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
Salama Nagy Daoud
exaly +3 more sources
Graceful Labeling of Spider Graphs With at Most Five Legs
Journal of Applied MathematicsA 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 +2 more sources
Polygonal Graceful Labeling of Some Simple Graphs
Ratio Mathematica, 2022 Let be a graph with vertices and edges. Let andbe the vertex set and edge set of respectively. A polygonal graceful labeling of a graph is an injective function , where is a set of all non-negative integers that induces a bijection , where is the ...
A Rama Lakshmi, M P Syed Ali Nisaya
doaj +1 more source