article Open Access
E-cordial labeling of bull related graphs and invariance
International Journal of Statistics and Applied Mathematics · 2018 · Vol. 3(2) · pp. 289–293
Abstract
A bull graph has a copy of C3 with pendent edge attached at two (adjacent) vertices. Similar structure is obtained on cycles C4, C5. We obtain e- cordial labeling of these graphs and one point union of these graphs. Further we show that one point union structures are invariant under e-cordial labeling.
Graph Labeling and Dimension Problemsgraph theory and CDMA systemsBlockchain Technology in Education and LearningCombinatoricsMathematicsGraphPoint (geometry)Invariant (physics)Discrete mathematicsGeometry
Citations
1
FWCI
0.00
field-weighted impact
References
0
Percentile
30%
vs. same field & year
Related articles
Some path unions invariance under cordial labeling
International Journal of Statistics and Applied Mathematics · 2018 · 0 citations
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.