Results 11 to 20 of about 29,676 (268)
Graceful Labeling of Spider Graphs With at Most Five Legs [PDF]
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.
A. Panpa, S. Imnang, T. Wasuanankul
doaj +4 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.
Gee-Choon Lau, Wai Chee Shiu, Ho-Kuen Ng
doaj +4 more sources
Edge even graceful labeling of torus grid graph [PDF]
Proyecciones (Antofagasta), 2020 We study the family of torus grid graphs. We also obtain necessary and sufficent conditions to be edge even graceful labeling for all of the cases of every member of this family.
S. N. Daoud, W. Saleh
semanticscholar +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 +3 more sources
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 +2 more sources
A note on edge – Graceful labeling for Corona and flower graph [PDF]
AIP Conference Proceedings, 2019 Research in graph theory has lead to one of the important area called labeling of graphs. There are different types of labeling such as graceful labeling, magic labeling, edge-graceful labeling, prime labeling, radio labeling, harmonious labeling etc ...
J. Uma, A. M. Shanofer
semanticscholar +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 +3 more sources
Edge even graceful labeling of some corona graphs [PDF]
Journal of Physics: Conference Series, 2021 Elsonbaty and Daoud introduced a labeling of graph with p vertices and q edges called edge even graceful labeling i.e. a bijective function f of the edge set E(G) into the set {2,4,6, . . . , 2q} such that the induced function f*:V(G) → {0,2,4, . . ., 2k
D. Jayantara, Purwanto, S. Irawati
semanticscholar +2 more sources
Edge even graceful labeling of some graphs [PDF]
Journal of the Egyptian Mathematical Society, 2019 Edge even graceful labeling is a new type of labeling since it was introduced in 2017 by Elsonbaty and Daoud (Ars Combinatoria 130:79–96, 2017). In this paper, we obtained an edge even graceful labeling for some path-related graphs like Y- tree, the ...
Mohamed R. Zeen El Deen
semanticscholar +3 more sources
Graceful labeling on torch graph [PDF]
Indonesian Journal of Combinatorics, 2018 Let G be a graph with vertex set V=V(G) and edge set E=E(G). An injective function f:V --> {0,1,2,...,|E|} is called graceful labeling if f induces a function f*(uv)=|f(u)-f(v)| which is a bijection from E(G) to the set {1,2,3,...,|E|}.
Jona Martinus Manulang, Kiki A. Sugeng
doaj +2 more sources