article Open Access
Path and cycle related families of E-Cordial graph
International Journal of Statistics and Applied Mathematics · 2018 · Vol. 3(1) · pp. 263–265
Abstract
The two copies of graph G(p, q) are joined by t paths on n-points each We represent the family by G(tPn). The paths are attached at the same fixed point on G. We discuss E-cordiality of C3(Pn), K4(Pn), S4(Pn) (shel graph S4 ) We show that under certain conditions these graphs are E-cordial.
Graph Labeling and Dimension ProblemsGraph theory and applicationsAdvanced Graph Theory ResearchCombinatoricsGraphMathematicsDiscrete mathematicsPath (computing)Computer scienceComputer network
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.