Results 1 to 10 of about 2,267 (72)
Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs [PDF]
IEEE Access, 2019 Solairaju and Chithra introduced a new type of labeling of a graph G with p vertices and q edges called an edge odd graceful labeling if there is a bijection f from the edges of the graph to the set {1, 3, ...
S. N. Daoud
doaj +5 more sources
The Edge Odd Graceful Labeling of Water Wheel Graphs [PDF]
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(
Mohammed Aljohani, Salama Nagy Daoud
doaj +5 more sources
Edge Odd Graceful Labeling in Some Wheel-Related Graphs [PDF]
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
Mohammed Aljohani, Salama Nagy Daoud
doaj +5 more sources
Edge odd graceful labeling of some path and cycle related graphs
AKCE International Journal of Graphs and Combinatorics, 2017 Solairaju and Chithra introduced a new type of labeling of a graph with vertices and edges called an edge odd graceful labeling if there is a bijection from the edges of the graph to the set such that, when each vertex is assigned the sum of all edges ...
S.N. Daoud
doaj +4 more sources
Edge odd graceful labeling of some snake net and pleated snake graphs [PDF]
AIP Conference Proceedings, 2022 Maulidatus Soleha +2 more
exaly +3 more sources
Edge even and edge odd graceful labelings of Paley Graphs
Journal of Physics: Conference Series, 2021 Abstract Edge even graceful labeling is a novel graceful labelling, introduced in 2017 by Elsonbaty and Daoud. A graph G with p vertices and q edges is called an edge even graceful if there is a bijection f: E(G) → {2, 4,. . ., 2q} such that, when each vertex is assigned the sum of the labels of all edges incident to it mod 2k, where k =
T Kamaraj, J Thangakani
openaire +2 more sources
Odd graceful labeling for the jewel graph and the extended jewel graph without the prime edge*
Bulletin of Pure & Applied Sciences Section E: Mathematics, 2020 J. Jeba Jesintha +2 more
exaly +3 more sources
Graphs with edge-odd graceful labelings
International Mathematical Forum, 2013 Solairaju and Chithra [3] introduced a new type of labeling of a graph G with q edges called an edge-odd graceful lebeling if there is a bijection f from the edges of the graph to the set {1, 3, 5, . . . , 2q − 1} such that, when each vertex is assigned the sum of all the edges incident to it mod 2q, the resulting vertex labels are distinct.
Sirirat Singhun
openaire +2 more sources
Edge Odd Graceful Labeling for Different Paths using Padavon Sequence
International Journal of Computer Applications, 2013 The even graceful labeling of a graph G with q edges means that there is an injection f : V(G) to { 0,1,1,1,2,...,2q+i/i= 1 to n} such that when each edge uv is assigned the label |f(u) – f(v)| the resulting edge labels are {1,3,5,...,2q-1}. A graph which admits an edge odd graceful labeling is called an edgeodd graceful graph.
S. Umamaheswari
openaire +2 more sources
On edge-graceful labeling and deficiency for regular graphs
AKCE International Journal of Graphs and Combinatorics, 2018 An edge-graceful labeling of a finite simple graph with vertices and edges is a bijection from the set of edges to the set of integers such that the vertex sums are pairwise distinct modulo , where the vertex sum at a vertex is the sum of labels of all ...
Tao-Ming Wang, Guang-Hui Zhang
doaj +4 more sources