Scinovex
article Open Access

Some path unions invariance under cordial labeling

Abstract

In this paper we define some new path unions, obtain different path unions from same graph and show them to be invariant under cordial labelings. i.e. we actually obtain cordial labeling of these different structures. We define bull graph and show that Path union of bull graph G = pm(C3bull) all three non isomorphic structures, Path union of C4 bull graph (G = pm(C4bull) all three non isomorphic structures, Path union of C3+ all two structures, Path union of C+4-e all five structures are cordial graphs.

Graph Labeling and Dimension ProblemsAdvanced Graph Theory Researchgraph theory and CDMA systemsMathematicsPath (computing)CombinatoricsGraphDiscrete mathematicsComputer scienceComputer network
Citations
0
FWCI
0.00
field-weighted impact
References
0
Percentile
21%
vs. same field & year
Related articles
E-cordial labeling of bull related graphs and invariance
International Journal of Statistics and Applied Mathematics · 2018 · 1 citations
Product cordiality of path union of mix graphs
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.