Prime Difference Mean Cordial Labeling of Path and Cycle Graphs

S. Asha and Jeena. R .V

Prime Difference Mean Cordial Labeling of Path and Cycle Graphs

Authors

S. Asha and Jeena. R .V

Keywords:

prime, mean, cordial, mean cordial, difference mean cordial, prime difference mean cordial, path, cycle.

Abstract

a graph with p vertices and q edges. A graph G is said to be a primedifference
mean cordial labeling if there exists an injective function

References

Cahit. I, Cordial Graphs :A Weaker Version of Graceful and Harmonious Graphs, Ars Combinatoria, Vol.23, No.3, pp.201-207, 1987.

Downloads

Published

2024-07-20

How to Cite

S. Asha and Jeena. R .V. (2024). Prime Difference Mean Cordial Labeling of Path and Cycle Graphs . Journal of Computational Analysis and Applications (JoCAAA), 33(1A), 636–643. Retrieved from https://eudoxuspress.com/index.php/pub/article/view/3383