Hypo-k-Totally Magic Cordial Labeling of Graphs

• Jeyanthi, P. ^[2] ; Benseera, N. Angel ^[3] ; Lau, Gee Gee ^[1]
  1. [1] Universiti Teknologi MARA

     Universiti Teknologi MARA

     Malasia

     
  2. [2] Govindammal Aditanar College for Women.
  3. [3] Sri Meenakshi Government Arts College for Women.

  Mostrar afiliaciones +
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 34, Nº. 4, 2015, págs. 351-359
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • A graph G is said to be hypo-k-totally magic cordial if G — {v} is k-totally magic cordial for each vertex v in V(G). In this paper, we establish that cycle, complete graph, complete bipartite graph and wheel graph admit hypo-k-totally magic cordial labeling and some families of graphs do not admit hypo-k-totally magic cordial labeling.