article Open Access
Product cordiality of path union of mix graphs
International Journal of Statistics and Applied Mathematics · 2018 · Vol. 3(3) · pp. 98–101
Abstract
We obtain mixed path union Pm (G1, G2) and discuss it for product cordiality, where G1 and G2 are from C3, C4, bull graph. In this type of path union G1 and G2 are fused at alternate vertices of Pm. Note that the minimum length of a mixed path union is 2 if we have to notice that it is a mixed path union.
graph theory and CDMA systemsInterconnection Networks and SystemsAdvanced Graph Theory ResearchPath (computing)CombinatoricsMathematicsProduct (mathematics)NoticeGraphDiscrete mathematicsComputer sciencePolitical scienceLaw
Citations
0
FWCI
0.00
field-weighted impact
References
0
Percentile
24%
vs. same field & year
Related articles
Some path unions invariance under cordial labeling
International Journal of Statistics and Applied Mathematics · 2018 · 0 citations
E-cordial labeling of bull related graphs and invariance
International Journal of Statistics and Applied Mathematics · 2018 · 1 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.