SciELO - Scientific Electronic Library Online

 
vol.34 número4Comment on "Edge Geodetic Covers in GraphsOn the hyperstability of a Cauchy-Jensen type functional equation in Banach spaces índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Servicios Personalizados

Revista

Articulo

Indicadores

Links relacionados

  • En proceso de indezaciónCitado por Google
  • No hay articulos similaresSimilares en SciELO
  • En proceso de indezaciónSimilares en Google

Compartir


Proyecciones (Antofagasta)

versión impresa ISSN 0716-0917

Proyecciones (Antofagasta) vol.34 no.4 Antofagasta dic. 2015

http://dx.doi.org/10.4067/S0716-09172015000400004 

Proyecciones Journal of Mathematics Vol. 34, No 4, pp. 351-359, December 2015. Universidad Católica del Norte Antofagasta - Chile

Hypo-k-Totally Magic Cordial Labeling of Graphs

P. Jeyanthi

Govindammal Aditanar College of Women

N. Angel Benseera 

Sri Meenakshi Govt. Arts College for Women (Autonomous)

India

Gee-Choon Lau

Universiti Teknologi Mara Johor

Malaysia 


ABSTRACT

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.

Keywords : k-totally magic cordial labeling, hypo-k-totally magic cordial labeling, hypo-k-totally magic cordial graph,complete graph, complete bipartite graph,wheel graph.

AMS Classification (2010) : 05C78.


REFERENCES

[1]    I. Cahit, Cordial graphs: A weaker version of graceful and harmonious graphs, Ars Combin., 23, pp. 201-207, (1987).         [ Links ]

[2]    I. Cahit, Some totally modular cordial graphs, Discuss. Math. Graph Theory, 22, pp. 247-258, (2002).         [ Links ]

[3]    F. Harary, Graph Theory, Addison-Wesley Publishing Co., (1969).         [ Links ]

[4]    P. Jeyanthi, N. Angel Benseera and M. Immaculate Mary, On totally magic cordial labeling, SUT Journal of Mathematics, 49, pp. 13-18, (2013).         [ Links ]

[5]    P. Jeyanthi and N. Angel Benseera, Totally magic cordial labeling of one-point union of n copies of a graph, Opuscula Mathematica, 34 (1), pp. 115-122, (2014).         [ Links ]

[6]    P. Jeyanthi and N. Angel Benseera, Totally magic cordial deficiency of some graphs, Utilitas Mathematica, (to appear).         [ Links ]

[7]    P. Jeyanthi, N. Angel Benseera and Gee-Choon Lau, On k-Totally magic cordial labeling of graphs, Discrete Mathematics, Algorithms and Applications, Vol. 7, No. 3, 1550024, 7 pages, (2015), DOI: 10.1142/S179383091550024X.         [ Links ]

[8]    P. Jeyanthi and N. Angel Benseera, Totally magic cordial labeling of some graphs, Journal of Algorithms and Computation, 46 (1), pp. 1-8, 2015.         [ Links ]

P. Jeyanthi

Research Centre,

Department of Mathematics,

Govindammal Aditanar College for Women, Tiruchendur - 628 215,

Tamil Nadu,

India

e-mail: jeyajeyanthi@rediffmail.com

N. Angel Benseera

Department of Mathematics

Sri Meenakshi Government Arts College for Women (Autonomous), Madurai - 625 002,

Tamil Nadu,

India

e-mail: angelbenseera@yahoo.com

Gee-Choon Lau

Faculty of Computer & Mathematical Sciences Universiti Teknologi MARA Johor 85009, Segamat,

Malaysia

e-mail: geeclau@yahoo.com

Received : April 2015. Accepted : July 2015

Creative Commons License Todo el contenido de esta revista, excepto dónde está identificado, está bajo una Licencia Creative Commons