CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

VGTool: Web Tool for Visualizing and Determining the Class of Gracefully Labeled Tree

by Jannatul Maowa, Sharifa Rania Mahmud
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 180 - Number 52
Year of Publication: 2018
Authors: Jannatul Maowa, Sharifa Rania Mahmud
10.5120/ijca2018917364

Jannatul Maowa, Sharifa Rania Mahmud . VGTool: Web Tool for Visualizing and Determining the Class of Gracefully Labeled Tree. International Journal of Computer Applications. 180, 52 ( Jun 2018), 32-36. DOI=10.5120/ijca2018917364

@article{ 10.5120/ijca2018917364,
author = { Jannatul Maowa, Sharifa Rania Mahmud },
title = { VGTool: Web Tool for Visualizing and Determining the Class of Gracefully Labeled Tree },
journal = { International Journal of Computer Applications },
issue_date = { Jun 2018 },
volume = { 180 },
number = { 52 },
month = { Jun },
year = { 2018 },
issn = { 0975-8887 },
pages = { 32-36 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume180/number52/29595-2018917364/ },
doi = { 10.5120/ijca2018917364 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T01:04:20.050182+05:30
%A Jannatul Maowa
%A Sharifa Rania Mahmud
%T VGTool: Web Tool for Visualizing and Determining the Class of Gracefully Labeled Tree
%J International Journal of Computer Applications
%@ 0975-8887
%V 180
%N 52
%P 32-36
%D 2018
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A tree is a connected acyclic graph on n vertices and n-1 edges. Graceful labeling of a tree is a labeling of its vertices with the numbers from 0 to n-1, so that no two vertices share a label, labels of edges, being absolute difference of the labels of its end points, are also distinct. There is a famous conjecture named Graceful tree conjecture or Ringel-Kotzig Conjecture that says “All trees are graceful”. Almost 50-year old conjecture is yet to be proved. However, researchers have been able to prove that many classes of trees are graceful. In this paper, we have introduced a new web tool named VGTool which help many researcher to know which classes of trees already been proved to be graceful. Moreover, researcher can generate random tree by using this web tool and verify in which class this tree belongs. If it is belongs to some known class then web tool generate graceful labeling of this tree otherwise researcher can try to classify this tree. We hope this web tool will help researcher in a very useful way.

References
  1. Abhyankar, V. J., and Bhat-Nayak, V. N. 2000. Easiest graceful labeling of olive trees. Bull. Bombay Math. Coll., 14:16–25.
  2. Abhyanker, V. J. 2002. Direct methods of gracefully labelling graphs. Technical report, University of Mumbai.
  3. Alfred, R. and McKay, B. 1998. Graceful and harmonious labeling of trees. Bull. Inst.Appl., 23:69–72.
  4. Alfred, R., Siran, J. and Siran, M. 2003. A note on the number of graceful labelings of paths. Discrete Math. 261:27–30.
  5. Bermond, J. C. 1979. Graceful graphs, radio antennae and french windmills. Graph Theory and Combinatorics, Pitman, London, 18–37.
  6. Bhat-Nayak, V. and Deshmukh, D. 1996. New families of graceful banana trees. Proc. Indian Acad. Sci. Math. Sci. 106:201–216.
  7. Bloom, G. S. and Golomb, S. W. 1977. Applications of numbered undirected graphs. Proceedings of the IEEE. 165(4):562–570.
  8. M. Burzio and G. Ferrarese. 1998. The subdivision graph of a graceful tree is a graceful tree. Discrete Math. (181):275–281.
  9. Chen, W. C., Lu, H. I. and Yeh, Y. N. 1997. Operations of interlaced trees and graceful trees. Internat. J. Algor. Comput. Math. 21:337–348.
  10. Edwards, M. and Howard, L. A. 2006. survey of graceful trees. Atlantic Electronic Journal of Mathematics. 1(1).
  11. Gallian, J. 2014. A dynamic survey of graph labeling. the electronic journal of combinatorics. 17.
  12. Hegde, S. M. and Shetty, S. 2002. On graceful trees. Applied Mathematics E-Note. (2):192–197.
  13. Hossain, M. F., Aziz, A., Momin, M. and M. Kaykobad. 2014. New classes of graceful trees. Utilitas Mathematica. 2014:6.
  14. Huang, C. K. and Rosa, A. 1982. A further results on tree labellings. Utilitas Mathematica, 21:31–48.
  15. Jin, D. J. and Wang, J. 1993. The gracefulness of the tree with a diametertour. Technical report, Acta Scientiarum Naturalium Universitaties Jilinensis,1:17-22.
  16. Munia, A. A., Maowa, J., Tania, S. and Kaykobad, M. 2014. A new class of graceful tree. International Journal of Scientific and Engineering Research (IJSER), 5(11):1112–1115.
  17. Ramachandran, V. and Sekar, C. 2014. One modulo n gracefulness of regular bamboo tree and coconut tree. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks & Sensor Networks, 6(2).
  18. Robeva, E. 2011. An extensive survey of graceful trees. Technical report. Stanford University.
  19. Rosa, A. 1967. On certain valuations of the vertices of a graph. Inter-nat. Symposium, Rome, July 1966, 349–355.
  20. Roy, T. G., Aryabhatta, S., Uddin, M. M. and Rahman, M. S. 2011. Ongraceful labelings of trees. In Proceedings of WALCOM, Lecture Notesin Computer Science, 6552, 17:214–220.
  21. Sekar, C. 2002. Studies in graph theory. Technical report, Ph.D. Thesis, Madurai Kamaraj University.
  22. Watson, R. L. 1972. A survey on the graceful labeling of graphs. Technical report, B.S., Roanoke College.
Index Terms

Computer Science
Information Sciences

Keywords

graceful labeling graph theory graceful tree conjecture web tool

Powered by PhDFocusTM