Generation of graceful trees from arbitrary trees
2
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
A function f is called graceful labeling of a graph G with m edges if f is an injective funtions from V(G) to (formula) such that when every edge ub is assigned the edge label (formula), then the resulting edge labels are distinct. A graph which admits graceful labeling is called a graceful graph. The popular graceful tree conjecture states that every tree is graceful. In spite of many significant results on graceful tree conjecture, it remains open over four decades. In this paper, we introduce a new method of consturcting graceful trees by an algorithm that will generate a graceful tree every given arbitrary tree
Abstract
A function f is called graceful labeling of a graph G with m edges if f is an injective funtions from V(G) to (formula) such that when every edge ub is assigned the edge label (formula), then the resulting edge labels are distinct. A graph which admits graceful labeling is called a graceful graph. The popular graceful tree conjecture states that every tree is graceful. In spite of many significant results on graceful tree conjecture, it remains open over four decades. In this paper, we introduce a new method of consturcting graceful trees by an algorithm that will generate a graceful tree every given arbitrary tree
참고문헌 (10)
- B.D. Acharya, "Embedding and NP-Complete problems for Graceful Graphs, Labelings of Discrete Structures and Applications", pp.57~62 (2008), Narosa Publishing House
- J.A.Gallian, "A Dynamic Survey of Graph Labeling", The Electronic Journal of Combinatorics, 19 (2012)
- M.R. Garey, "Computers and Intractibility: A Guide to the Thoery of NP-completeness" (1979), W.H. Freeman
- Golomb S.W, "How to number a graph, Graph Theory and Computing", pp.23~37 (1972), Academic Press
- Jeba Jesintha.J, "All arbitrary fixed generalized banana trees are graceful", Math. Comput. Sci, 5(1), pp.51~62 (2011)
- Ringel G, "Problem 25, in Theory of Graphs and its Applications", Proc. Symposium Smolenice, pp.162~ (1963)
- Rosa A, "On certain valuations of the vertices of a graph, Theory of graphs", International Symposium (1966)
- Sethuraman G., "All banana trees are graceful", Advanced Applied Discrete Mathematics, 4(1), pp.53~64 (2009)
- Thomas Cormen, "Introduction to Algorithms", MIT Press
- West D. B., "Introduction to Graph Theory" (2001), Prentice Hall