Even Vertex Graceful Labeling for Two Graphs

Manisha M. Acharya

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

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 9 | Number 3 | Year 2014 | Article Id. IJMTT-V9P523 | DOI : https://doi.org/10.14445/22315373/IJMTT-V9P523

Even Vertex Graceful Labeling for Two Graphs

Manisha M. Acharya

Citation :

Manisha M. Acharya, "Even Vertex Graceful Labeling for Two Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 9, no. 3, pp. 192-196, 2014. Crossref, https://doi.org/10.14445/22315373/IJMTT-V9P523

Abstract

In this paper Even vertex graceful labeling for two graphs namely prism (Dn) and Book (Bn) is defined. For Book (Bn) it is given for the case when ‘n’ is even.

Keywords

Prism, Book, Even vertex gracefulness, Labeling of graphs.

References

1) Manisha Acharya ,Even vertex gracefulness of book Bn when n is odd , Online International Interdisciplinary Research Journal(2249-9598): Vol. IV, Issue III(May 2014)
2) C. Barrientos and H. Hevia,On 2- Equitable Labelings Of Graphs, Research supported in part by FONDECYT project 1941219(94)
3) C. Barrientos, Odd-Graceful Labelings Of Trees Of Diameter 5,AKCE J. Graphs. Combin,6,No.2(2009)
4) Gallian, J.A. 2009. A Dynamic Survey of Graph Labeling. The Electronic Journal of Combinatorics. (Jan 31, 2009).
5) Harary,Graph Theory, Addison-Wesley,1968.
6) A. Solairaju and P. Murugananthan. Even vertex graceful of Path,Circuit, Star, Wheel,some Extension-friendship Graphs and Helm Graph, International Journal of Computer Applications(0975-8887),vol.10-No.6,Nov.2010
7) A. Solairaju and P. Muruganantham, Even vertex gracefulness of fan graph, International Journal of Computer Applications (0975-8887): Vol, 8. No. 8, (October, 2012).