Results 221 to 230 of about 307 (247)

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   +1 more source

Evolving labelings of graceful graphs

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

Graceful Labelling of Corona Product of Aster Flower Graph [PDF]

, 2018
Elvi Khairunnisa, Kiki Ariyanti Sugeng
exaly   +2 more sources

On Farey Graceful Labeling

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

MPLS multicasting using caterpillars and a graceful labelling scheme [PDF]

A. Basak
exaly   +2 more sources

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

Graceful Labelling: State of the Art, Applications and Future Directions

Mathematics in Computer Science, 2011
Ian Wanless, Ljiljana Brankovic, Wanless Ian M   +2 more
exaly  

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   +1 more source

On 0-Rotatable Graceful Caterpillars

Graphs and Combinatorics, 2020
Bruce Richter, Atilio G Luiz, C N Campos   +2 more
exaly