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₃ i.e. Pn(C₃), Antena (C₃,m) are evpc graphs.

Pages: 272-274 | Views: 1067 | Downloads: 14

Download Full Article: Click Here