Results 1 to 10 of about 4,425 (218)
On edge-graceful labeling and deficiency for regular graphs
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
Tight super-edge-graceful labelings of trees and their applications [PDF]
The concept of graceful labeling of graphs has been extensively studied. In 1994, Mitchem and Simoson introduced a stronger concept called super-edge-graceful labeling for some classes of graphs.
Alex Collins, Colton Magnant, Hua Wang
doaj +4 more sources
Extending of Edge Even Graceful Labeling of Graphs to Strong r-Edge Even Graceful Labeling [PDF]
Edge even graceful labeling of a graph G with p vertices and q edges is a bijective f from the set of edge EG to the set of positive integers 2,4,…,2q such that all the vertex labels f∗VG, given by f∗u=∑uv∈EGfuvmod2k, where k=maxp,q, are pairwise ...
Mohamed R. Zeen El Deen, Nora A. Omar
doaj +2 more sources
Polygonal Graceful Labeling of Some Simple Graphs [PDF]
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 +3 more sources
Edge δ− Graceful Labeling for Some Cyclic-Related Graphs [PDF]
In this paper, we introduce a new type of labeling of a graph G with p vertices and q edges called edge δ− graceful labeling, for any positive integer δ, as a bijective mapping f of the edge set EG into the set δ,2δ,3δ,⋯,qδ such that the induced mapping ...
Mohamed R. Zeen El Deen
doaj +2 more sources
On edge graceful labelings of disjoint unions of $2r$-regular edge graceful graphs [PDF]
We prove that if $G$ is a $2r$-regular edge graceful $(p,q)$ graph with $(r,kp)=1$ then $kG$ is edge graceful for odd $k$. We also prove that for certain specific classes of $2r$-regular edge graceful graphs it is possible to drop the requirement that $(r,kp)=1$
Riskin, Adrian, Weidman, Georgia
openaire +3 more sources
New classes of graphs with edge δ− graceful labeling
Graph labeling is a source of valuable mathematical models for an extensive range of applications in technologies (communication networks, cryptography, astronomy, data security, various coding theory problems).
Mohamed R. Zeen El Deen, Ghada Elmahdy
doaj +2 more sources
Study on Binary Equivalent Decimal Edge Graceful Labeling
Let G (V(G), E(G)) be a graph with n vertices is said to be Binary Equivalent Decimal Edge Graceful Labeling (BEDE) graph if the vertices are assigned distinct numbers from 0,1,2,…,(n-1) such that the labels induced on edges by the values obtained using binary coding of end vertices for each edge which are distinct. This paper deals with graphs such as
V. Rajeswari, K. Thiagarajan
openaire +3 more sources
Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs [PDF]
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 +2 more sources
Edge Odd Graceful Labeling in Some Wheel-Related Graphs [PDF]
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

