Scinovex
article Open Access

Invariance under cordiality of C4 and Pm related graphs under path: unions

Abstract

We discuss one point union of k copies og G i.e. G(k) where G = crown of C4, C4 and Pm for m = 3, 4, 5.We also obtain cordial labeling of C4 and Pm.

Graph Labeling and Dimension Problemsgraph theory and CDMA systemsAdvanced Graph Theory ResearchCombinatoricsPath (computing)MathematicsPoint (geometry)Mathematical economicsDiscrete mathematicsComputer scienceGeometry
Citations
0
FWCI
0.00
field-weighted impact
References
0
Percentile
30%
vs. same field & year
Citation Network

How this paper connects to the literature. Drag to explore, click any node to open that paper.