A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
International Journal of Statistics and Applied Mathematics 2017; 2(6): 92-94 Extended vertex edge additive cordial (EVEAC) labeling-a new labeling method for graphs
2017
unpublished
Preserved Fulltext
In this paper we discuss a new type of graph labeling Extended Vertex Edge Additive Cordial (eveac) labeling and show that path Pn, K1,n, K2,n, K3,n, K4,n are eveac graphs.
fatcat:slogmj3f3zh65kdcxm5afftflu