article
Extended vertex edge additive cordial (EVEAC) labeling-a new labeling method for graphs
International Journal of Statistics and Applied Mathematics · 2017 · Vol. 2(6) · pp. 92–94
Abstract
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.
Graph Labeling and Dimension ProblemsBlockchain Technology in Education and LearningEdge-graceful labelingCombinatoricsGraph labelingVertex (graph theory)MathematicsEnhanced Data Rates for GSM EvolutionComputer scienceGraphArtificial intelligenceLine graph
Citations
0
FWCI
0.00
field-weighted impact
References
0
Percentile
33%
vs. same field & year
Related articles
Extended vertex product cordial (evpc) labeling of graphs
International Journal of Statistics and Applied Mathematics · 2018 · 0 citations
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.