Published
June 30, 2019
Keywords
- Mean Cordial graph and star.
How to Cite
S, S., J, D., V, M., & V, B. (2019). Mean Cordial Labeling for Two Star Graphs. Journal of Computational Mathematica, 3(1), 6-14. https://doi.org/10.26524/cm43
Abstract
In this paper we prove that the two star k1,g∧k1,h is mean cordial graph if and only if |2g − h| ≤ 4 for g ≤ h and g = 1, 2, 3, · · · .
Downloads
Download data is not yet available.