Results 211 to 220 of about 103,423 (250)

Seeing the Plane: Video Review as a Tool to Improve Total Mesorectal Excision Training

ANZ Journal of Surgery, EarlyView.
Rathin Gosavi, Vignesh Narasimhan, Rebecca Shine, Paul McMurrick, Satish Warrier   +4 more
wiley   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Graceful Cascading Labelling Algorithm: Construction of Graceful Labelling of Trees

2021 2nd International Conference on Robotics, Electrical and Signal Processing Techniques (ICREST), 2021
The Graceful Labelling of trees is one of the most challenging conjectures in Graph Theory, proudly known as the 'Disease' of Graph Theory which remains a challenge as it remains unsolved. To counter the conjecture, an algorithm is proposed to construct a Graceful Binary Tree and a Graceful Caterpillar Tree.
Dipta Gomes, Md Manzurul Hasan
exaly   +2 more sources

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.
VIETRI, Andrea
openaire   +3 more sources

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 0001, Lijuan Xu   +2 more
openaire   +2 more sources

0-Centred and 0-ubiquitously graceful trees [PDF]

Discrete Mathematics, 2004
A tree T is k-centred graceful if it has a graceful labelling f such that f assigns the label k to the centre vertex (or one of the centres if the tree has odd diameter); similarly, a graph G is k-ubiquitously graceful if for every vertex v∈V(G) there is
Van Bussel, Frank
exaly   +2 more sources

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

The Generation of k-Graceful Figure and Graceful Label

2014 Fourth International Conference on Instrumentation and Measurement, Computer, Communication and Control, 2014
This paper introduces the concept of graceful figure, discusses a special kind of graceful figure: K-graceful figure, draw all the graceful figure of the generated by the n side of all the beautiful label generation algorithm. The algebraic theory and computer tools introduced a graceful figure.
Jia Peipei, Zhang Tai, Zhang Yuanyuan
openaire   +1 more source

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