Vertex Prime Labeling of Path Related Graphs

Mukund V. Bapat

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

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 56 | Number 5 | Year 2018 | Article Id. IJMTT-V56P549 | DOI : https://doi.org/10.14445/22315373/IJMTT-V56P549

Vertex Prime Labeling of Path Related Graphs

Mukund V. Bapat

Citation :

Mukund V. Bapat, "Vertex Prime Labeling of Path Related Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 56, no. 5, pp. 366-371, 2018. Crossref, https://doi.org/10.14445/22315373/IJMTT-V56P549

Abstract

Two graphs or two copies of given graph are joined by some paths are referred as path related graphs. In this paper we discuss two copies of given graph joined at same vertex by t paths of same length for vertex prime labeling. These families are denoted by G(t-Pm) where t is the number of paths Pm.We refer these graphs when t = 1 as G(Pm). We choose G as W4 and Gear graph G4. We also discuss W4(t-Pm) G4which is family of graphs having tpaths of same length between W4 and G4.

Keywords

Path, labeling, vertex prime, graph.

References

[1] Mukund V. Bapat Ph.D. thesis, university of Mumbai,India,2004.
[2] T. Deretsky, S. M. Lee, and J. Mitchem, On vertex prime labelings of graphs, in Graph Theory, Combinatorics and Applications Vol. 1, J. Alavi, G. Chartrand, O. Oellerman, and A. Schwenk, eds., Proceedings 6th International Conference Theory and Applications of Graphs (Wiley, New York, 1991) 359-369.
[3] Joe Gallian Dynamic survey of graph labeling 2016
[4] Harary,GraphTheory,Narosa publishing ,New Delhi
[5] Yilmaz,Cahit ,E-cordial graphs,Ars combina,46,251-256.
[6] Introduction to Graph Theory by D. WEST, Pearson Education Asia. 1 Mukund V. Bapat, Hindale,Devgad,Sindhudurg,Maharashtra India: 416630