Type of Graph Labeling

M.Jayafranglin

doi:https://doi.org/10.14445/22315373/IJMTT-V59P517

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 59 | Number 2 | Year 2018 | Article Id. IJMTT-V59P517 | DOI : https://doi.org/10.14445/22315373/IJMTT-V59P517

Type of Graph Labeling

M.Jayafranglin

Citation :

M.Jayafranglin, "Type of Graph Labeling," International Journal of Mathematics Trends and Technology (IJMTT), vol. 59, no. 2, pp. 109-112, 2018. Crossref, https://doi.org/10.14445/22315373/IJMTT-V59P517

Abstract

Any tree n vertices is connected to ge graceful if it is verities can be labeled using integers 0,1…….n-1 such that each vertex label as well as the corresponding edge label is distinct throughout the tree. Three has multiple attempts with different approaches to prove this conjecture but it remains the same. Here as well as discuss the methods used to solve this problem and types of graceful labeling.

Keywords

harmonious labeling ,lucky labeling, graph coloring, edge – graceful labeling

References

[1] N.Harary, Graph theory (1969) Addison –Wesley.
[2] A.Rosa, “On certain valuations of the vertices of a graph”, theory of graph international symposium, Rome 1966.
[3] Frank Van Russel “Relaxed graph labeling of trees”, the Electronic Journal of combinatorics 2002.