Results 11 to 20 of about 1,092,292 (254)
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.
A. Panpa, S. Imnang, T. Wasuanankul
doaj +3 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
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
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 on torch graph
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
Edge-Graceful Labelings of Connected Graphs
Electronic Notes in Discrete Mathematics, 2016 Abstract Let G be a connected edge-graceful ( p , q ) -graph with q = k p + r , where k is an integer and 0 ≤ r p . In this paper, we prove that every edge-graceful labeling f of G induces [ ( k + 1 ) ! ] r [ k ! ] p − r number of edge-graceful labelings of G.
R Amutha
exaly +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.
Gee-Choon Lau, Wai Chee Shiu, Ho-Kuen Ng
doaj +2 more sources
Edge even graceful labeling of torus grid graph
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.
Salama Nagy Daoud, Wedad Saleh
openaire +3 more sources
Super Edge Magic Graceful Labeling of Generalized Petersen Graphs
Electronic Notes in Discrete Mathematics, 2015 Abstract A ( p , q ) graph G is edge magic graceful if there exists a bijection f : V ( G ) ∪ E ( G ) → { 1 , 2 , … , p + q } such that | f ( u ) + f ( v ) − f ( u v ) | = k , a constant for any edge uv of G. G is said to be super edge magic graceful if f ( V ( G ) ) = { 1 , 2
G Marimuthu
exaly +2 more sources
Further results on edge even graceful labeling of the join of two graphs [PDF]
Journal of the Egyptian Mathematical Society, 2020 AbstractIn this paper, we investigated the edge even graceful labeling property of the join of two graphs. A function f is called an edge even graceful labeling of a graph G=(V(G),E(G)) with p=|V(G)| vertices and q=|E(G)| edges if f:E(G)→{2,4,...,2q} is bijective and the induced function f∗:V(G) →{0,2,4,⋯,2q−2 }, defined as $ f^{\ast }(x) = ({\sum ...
Nora Omar, Mohamed R Zeen El Deen
exaly +3 more sources