Vol. 3 No. 1 (2019): Vol 3, Iss 1, Year 2019
Articles

Mean Cordial Labeling for Two Star Graphs

pdf
  • Sudhakar S,
  • Dharani J,
  • Maheshwari V,
  • Balaji V
Sudhakar S
Department of Mathematics, Sacred Heart College, Tirupattur-635 601, Tamil Nadu,India.
Dharani J
Department of Mathematics, Sacred Heart College, Tirupattur-635 601, Tamil Nadu,India.
Maheshwari V
Department of Mathematics, Vells University, Chennai - 600 117, Tamil Nadu, India.
Balaji V
Department of Mathematics, Sacred Heart College, Tirupattur-635 601, Tamil Nadu,India.
DOI: https://doi.org/10.26524/cm43
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, · · · .

pdf

Downloads

Download data is not yet available.