International Journal of Statistics and Applied Mathematics
  • Printed Journal
  • Indexed Journal
  • Refereed Journal
  • Peer Reviewed Journal

International Journal of Statistics and Applied Mathematics

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 K1,n., Crown of Cn, Path union of C3 i.e. Pn(C3), Antena (C3,m) are evpc graphs.

Pages: 272-274 | Views: 478 | Downloads: 13

Download Full Article: Click Here
How to cite this article:
Mukund Bapat. Extended vertex product cordial (evpc) labeling of graphs. International Journal of Statistics and Applied Mathematics. 2018; 3(1): 272-274.
Call for book chapter
International Journal of Statistics and Applied Mathematics