2018, Vol. 3, Issue 1, Part D
Extended vertex product cordial (evpc) labeling of graphs
Author(s): Mukund Bapat
Abstract: In this paper
we discuss a new type of labeling called as extended vertex product cordial Labeling. (evpcl). We allow the vertices of a graph to take values from 0 to p-1,p being the number of vertices of a graph, and restrict the edges to take values 0 or 1 only. We show that path Pn, Star K
1,n., Crown of Cn, Path union of C
3 i.e. Pn(C
3), Antena (C
3,m) are evpc graphs.
Pages: 272-274 | Views: 1204 | Downloads: 14Download Full Article: Click Here
How to cite this article:
Mukund Bapat. Extended vertex product cordial (evpc) labeling of graphs. Int J Stat Appl Math 2018;3(1):272-274.
