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
• DOI: 10.4067/S0716-09172015000400004
• 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.

• Referencias bibliográficas
  • Citas [1] I. Cahit, Cordial graphs: A weaker version of graceful and harmonious graphs, Ars Combin., 23, pp. 201—207, (1987).
  • [2] I. Cahit, Some totally modular cordial graphs, Discuss. Math. Graph Theory, 22, pp. 247—258, (2002).
  • [3] F. Harary, Graph Theory, Addison-Wesley Publishing Co., (1969).
  • [4] P. Jeyanthi, N. Angel Benseera and M. Immaculate Mary, On totally magic cordial labeling, SUT Journal of Mathematics, 49, pp. 13—18, (2013).
  • [5] P. Jeyanthi and N. Angel Benseera, Totally magic cordial labeling of one-point union of n copies of a graph, Opuscula Mathematica, 34...
  • [6] P. Jeyanthi and N. Angel Benseera, Totally magic cordial deficiency of some graphs, Utilitas Mathematica, (to appear).
  • [7] P. Jeyanthi, N. Angel Benseera and Gee-Choon Lau, On k-Totally magic cordial labeling of graphs, Discrete Mathematics, Algorithms and...
  • [8] P. Jeyanthi and N. Angel Benseera, Totally magic cordial labeling of some graphs, Journal of Algorithms and Computation, 46 (1), pp. 1-8,...