article Open Access
Extended vertex product cordial (evpc) labeling of graphs
International Journal of Statistics and Applied Mathematics · 2018 · Vol. 3(1) · pp. 272–274
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.
Graph Labeling and Dimension ProblemsCombinatoricsVertex (graph theory)MathematicsGraphPath graphPath (computing)Discrete mathematicsComputer scienceGraph powerLine graph
Citations
0
FWCI
0.00
field-weighted impact
References
0
Percentile
30%
vs. same field & year
Related articles
Extended vertex edge additive cordial (EVEAC) labeling-a new labeling method for graphs
International Journal of Statistics and Applied Mathematics · 2017 · 0 citations
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.