Extended results on sum divisor cordial labeling

• Sugumaran, A. ^[1] ; Rajesh, K. ^[1]
  1. [1] Government Arts College.
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 38, Nº. 4, 2019, págs. 653-663
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • A sum divisor cordial labeling of a graph G with vertex set V (G) is a bijection f : V (G) → {1, 2, ..., |V (G)|} such that an edge uv assigned the label 1 if 2 divides f(u)+f(v) and 0 otherwise. Further the number of edges labeled with 0 and the the number of edges labeled with 1 differ by atmost 1. A graph with sum divisor cordial labeling is called a sum divisor cordial graph. In this paper we prove that the graphs Pn + Pn (n is odd), Pn@K1,m, Cn@K1,m (n is odd), Wn ∗ K1,m (n is even), < K₁¹,n,n ∆K₁²,n,n >, < Fln¹∆Fln² > are sum divisor cordial graphs.