dc.creator | Jeyanthi, P. | |
dc.creator | Benseera, N. Angel | |
dc.creator | Lau, Gee Gee | |
dc.date | 2015-12-01 | |
dc.identifier | http://www.revistaproyecciones.cl/article/view/1242 | |
dc.identifier | 10.4067/S0716-09172015000400004 | |
dc.description | 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. | es-ES |
dc.format | application/pdf | |
dc.language | spa | |
dc.publisher | Universidad Católica del Norte. | es-ES |
dc.relation | http://www.revistaproyecciones.cl/article/view/1242/955 | |
dc.rights | Derechos de autor 2015 Proyecciones. Journal of Mathematics | es-ES |
dc.source | Proyecciones. Journal of Mathematics; Vol 34 No 4 (2015); 351-359 | en-US |
dc.source | Proyecciones. Revista de Matemática; Vol. 34 Núm. 4 (2015); 351-359 | es-ES |
dc.source | 0717-6279 | |
dc.source | 0716-0917 | |
dc.title | Hypo-k-Totally Magic Cordial Labeling of Graphs | es-ES |
dc.type | info:eu-repo/semantics/article | |
dc.type | info:eu-repo/semantics/publishedVersion | |
dc.type | Artículo revisado por pares | es-ES |