Results 311 to 320 of about 1,379,256 (326)

ODD GRACEFUL LABELINGS OF GRAPHS

Discrete Mathematics, Algorithms and Applications, 2009
A graph G = (V(G), E(G)) with q edges is said to be odd graceful if there exists an injection f from V(G) to {0, 1, 2, …, 2q - 1} such that the edge labeling set is {1, 3, 5, …, 2q - 1} with each edge xy assigned the label |f(x) - f(y)|. In this paper, we prove that Pn × Pm (m = 2, 3, 4), generalized crown graphs Cn ⊙ K1,t and gear graphs are odd ...
Zhen-Bin Gao, Xiao-Dong Zhang, Li-Juan Xu   +2 more
openaire   +2 more sources

Graceful labeling based En (Grace) cryption and De (Grace) cryption

2013 IEEE International Conference ON Emerging Trends in Computing, Communication and Nanotechnology (ICECCN), 2013
In recent years, Encryption has fascinated extra responsiveness owing to the swift development in multimedia and network technologies where the data has to be shielded from unauthorized access. Image scrambling scheme provide protection for digital images.
N. R. Raajan, P. Mithun
openaire   +2 more sources

Graceful Labelings: The Shifting Technique

2017
Graceful labelings of graphs appeared in 1967 due to the relationship found with the problem of decompositions of graphs, in particular with the problem of decomposing complete graphs into copies of a given tree. Strong relations between graceful labelings and Golomb rulers (which are a different way to understand Sidon sets) were also found.
Francesc A. Muntaner-Batle, Susana C. López   +1 more
openaire   +2 more sources

A Metaheuristic Approach to the Graceful Labeling Problem

International Journal of Applied Metaheuristic Computing, 2010
In graph theory, a graceful labeling of a graph G = (V, E) with n vertices and m edges is a labeling of its vertices with distinct integers between 0 and m inclusive, such that each edge is uniquely identified by the absolute difference between its endpoints.
Kourosh Eshghi, Houra Mahmoudzadeh
openaire   +2 more sources

On Farey Graceful Labeling

National academy science letters, 2023
Ajay Kumar, Debdas Mishra, V. Srivastava
semanticscholar   +1 more source

Edge-odd graceful labeling of Cartesian product of two paths

Journal of Information and Optimization Sciences
Let G be a finite simple graph with p vertices and q edges is called an edge odd graceful labeling if there exists a bijective map f : E(G)→{1, 3, 5,,(2k − 1)} such that when each vertex is assigned, the sum of all edges incident to it mod 2k, where k =
D. Senthil Kumar, R. Anbarasan
semanticscholar   +1 more source

An efficient encryption process with graceful labeling – A hybrid approach

INTERNATIONAL CONFERENCE ON ADVANCES IN MATERIALS, COMPUTING AND COMMUNICATION TECHNOLOGIES: (ICAMCCT 2021), 2022
V. Shruthy, V. Maheswari
semanticscholar   +1 more source

Odd graceful labeling of super subdivision of few graphs

Bulletin of Pure & Applied Sciences- Mathematics and Statistics, 2022
J. Jesintha, D. Devakirubanithi, J. M. Sherlin   +2 more
semanticscholar   +1 more source

ODD GRACEFUL LABELING OF ARBITRARY SUPERSUBDIVISION OF CERTAIN GRAPHS

Advances and Applications in Discrete Mathematics, 2022
A. Velankanni, A. B. Raj
semanticscholar   +1 more source

G-GRACEFUL LABELING OF GRAPHS

Advances in Mathematics: Scientific Journal, 2020
Y. Khandelwal, K M P Kumar, V. Kumar, P. Gupta, A. Kumar   +4 more
openaire   +1 more source