Results 221 to 230 of about 103,423 (250)

Graceful Labelings of Nearly Complete Graphs

Results in Mathematics, 2002
A graph with \(q\) edges is graceful, if we can assign to each vertex an integer in \(\{0, 1, \ldots, q\}\), such that all edges have a different value of the absolute difference of the labels of its endpoints. This paper investigates which graphs that are `nearly complete', or a complete multipartite graph, are graceful.
Beutner, Detlev, Harborth, Heiko
openaire   +1 more source

On graceful and cordial labeling of shell graphs.

Ars Comb., 2011
A graceful labeling, an \(\alpha \)-labeling (called here \(\Delta \)-labeling), and a cordial labeling of yet another special class of graphs are provided. Unfortunately, the paper contains many typographical, grammatical and stylistic errors.
G. Sethuraman 0001, K. Sankar
openaire   +4 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.
P. Mithun, N. R. Raajan
openaire   +1 more source

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.
Houra Mahmoudzadeh, Kourosh Eshghi
openaire   +2 more sources

Evolving labelings of graceful graphs

Proceedings of the Genetic and Evolutionary Computation Conference, 2022
Luke Branson, Andrew M. Sutton
openaire   +1 more source

On Farey Graceful Labeling

National Academy Science Letters, 2023
Ajay Kumar, Debdas Mishra, V. K. Srivastava   +2 more
openaire   +1 more source

Graceful Labelings

2019
Gary Chartrand, Cooroo Egan, Ping Zhang
openaire   +1 more source

A Study on Graceful and ∅-Graceful Labeling of Some Graphs

International Journal of Computing Algorithm, 2017
M. Radhika, V. S. Selvi
openaire   +1 more source

On Locally Monotone Graceful Labelings

In previous versions some translations were missed and incorrect.
openaire   +1 more source

Graceful labelings of cyclic snakes.

Ars Comb., 2001
A graph \(G=(V,E)\) with \(m\) edges is called graceful if there is an injection \(f\: V\to \{0,1,\dots ,m\}=A\) such that \(\{| f(x)-f(y)| \:\{x,y\}\in E\}=B\) equals \(\{1,2,\dots ,m\}\). It is nearly graceful if \(A\) is replaced by \(\{0,1,\dots ,m+1\}\) and \(B\) equals \(\{1,2,\dots ,m\}\) or \(\{1,2,\dots ,m-1,m+1\}\).
openaire   +2 more sources