Towards the Graceful Tree Conjecture: A Survey
نویسندگان
چکیده
A graceful labelling of an undirected graph G with n edges is a one-to-one function from the set of vertices of G to the set {0, 1, 2, . . . , n} such that the induced edge labels are all distinct. An induced edge label is the absolute value of the difference between the two end-vertex labels. The Graceful Tree Conjecture states that all trees have a graceful labelling. In this survey we present known results towards proving the Graceful Tree Conjecture.
منابع مشابه
Embedding an Arbitrary Tree in a Graceful Tree
A function f is called a graceful labeling of a graph G with m edges if f is an injective function from V (G) to {0, 1, 2, · · · ,m} such that when every edge uv is assigned the edge label |f(u)− f(v)|, then the resulting edge labels are distinct. A graph which admits a graceful labeling is called a graceful graph. The popular Graceful Tree Conjecture states that every tree is graceful. The Gra...
متن کاملSailing towards, and then against, the Graceful Tree Conjecture: some promiscuous results
The Graceful Tree Conjecture is getting old – though 40 years are not so many – while researchers form all over the world keep on trying to put an affirmative end to it. Kotzig called a disease the effort of proving it. In this paper we fall into the opposite disease, namely by moving towards the search of a tree that is not graceful. Our first result, on suitable attachments of graceful trees,...
متن کاملA Survey of Graceful Trees
A tree of order n is said to be graceful if the vertices can be assigned the labels {0, . . . , n−1} such that the absolute value of the differences in vertex labels between adjacent vertices generate the set {1, . . . , n− 1}. The Graceful Tree Conjecture is the unproven claim that all trees are graceful. We present major results known on graceful trees from those dating from the problem’s ori...
متن کاملGraceful Tree Conjecture for Infinite Trees
One of the most famous open problems in graph theory is the Graceful Tree Conjecture, which states that every finite tree has a graceful labeling. In this paper, we define graceful labelings for countably infinite graphs, and state and verify a Graceful Tree Conjecture for countably infinite trees.
متن کاملA Computational Approach to the Graceful Tree Conjecture
Graceful tree conjecture is a well-known open problem in graph theory. Here we present a computational approach to this conjecture. An algorithm for finding graceful labelling for trees is proposed. With this algorithm, we show that every tree with at most 35 vertices allows a graceful labelling, hence we verify that the graceful tree conjecture is correct for trees with at most 35 vertices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004