Results 221 to 230 of about 408 (250)

On Graceful Labelings of Trees

2011
A tree is a connected acyclic graph. A tree of n vertices is said to be graceful if the vertices can be assigned the labels {0, 1, 2, ..., n - 1} such that the absolute value of the differences in vertex labels between neighboring vertices generate the set consisting distinct values {1, 2, 3, ...,n-1}.
Sourabh Aryabhatta, Tonmoy Guha Roy, Md. Mohsin Uddin, Md. Saidur Rahman   +3 more
openaire   +1 more source

Graceful and Antimagic Labelings

2019
This chapter explores the relationship between antimagic labeling and alpha labelings and also the well-known graceful labelings. Much of this chapter looks at interesting labelings and structures on trees, including edge antimagic trees, alpha trees, and disjoint union of caterpillars.
Martin Bača, Mirka Miller, Joe Ryan, Andrea Semaničová-Feňovčíková   +3 more
openaire   +1 more source

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

Real-graceful labellings: a generalisation of graceful labellings.

Ars Comb., 2011
Every graph can be associated to a characteristic exponential equation involving powers of (say) 2, whose unknowns represent vertex labels and whose general solution is equivalent to a graceful labelling of the graph. If we do not require that the solutions be integers, we obtain a generalisation of a graceful labelling that uses real numbers as labels.
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   +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.
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   +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

Edge even graceful labeling of Frn3,Fn,TPn,Wn and Tn

Materials Today: Proceedings, 2023
Pradeep G Bhat
exaly  

Graceful Labelings

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