Results 21 to 30 of about 1,379,256 (326)

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
Mohammed Aljohani, Salama Nagy Daoud
doaj   +2 more sources

Super fibonacci graceful anti – magic labeling for flower graphs and python coding

Tuijin Jishu/Journal of Propulsion Technology, 2023
A graph vertices and  edges. A super fibonacci graceful anti-magic labeling  of is an injective function   such that  the induced edge labeling  is a bijection onto the set   In addition, all the vertex sums are pairwise distinct and all the edges are ...
O. V. Shanmuga Sundaram D. Amuthavalli
openalex   +3 more sources

Odd Graceful Labeling of W -Tree W T ( n , k ) and its Disjoint Union [PDF]

Utilitas mathematica
Let G=(V(G),E(G)) be a graph with p vertices and q edges. A graph G of size q is said to be odd graceful if there exists an injection λ:V(G)→0,1,2,…,2q−1 such that assigning each edge xy the label or weight |λ(x)–λ(y)| results in the set of edge labels ...
Abaid ur Rehman Virk, A. Riasat
openalex   +2 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   +2 more sources

Application of odd hexagonal graceful labeling in cryptography [PDF]

International Journal of Advanced Academic Studies
Cryptography is regarded as a scientific discipline that achieves security by converting sensitive information into an unintelligible form that cannot be interpreted by anybody other than the transmitter and intended recipient.
Asha S, V. Akshaya
openalex   +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
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

An Algorithm for Odd Graceful Labeling of the Union of Paths and Cycles

, 2010
In 1991, Gnanajothi [4] proved that the path graph P_n with n vertex and n-1 edge is odd graceful, and the cycle graph C_m with m vertex and m edges is odd graceful if and only if m even, she proved the cycle graph is not graceful if m odd. In this paper,
Ibrahim Moussa M
openalex   +4 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   +3 more sources

Graceful Labeling of Hypertrees

Journal of Mathematics Research, 2021
Graph labeling is considered as one of the most interesting areas in graph theory. A labeling for a simple graph G (numbering or valuation), is an association of non -negative integers to vertices of G  (vertex labeling) or to edges of G  (edge labeling)
H. El-Zohny, S. Radwan, S. I. A. El-Fotooh, Z. Mohammed   +3 more
semanticscholar   +4 more sources