Hypo-k-Totally Magic Cordial Labeling of Graphs
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...
Guardado en:
| Autores principales: | , , |
|---|---|
| Lenguaje: | English |
| Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2015
|
| Materias: | |
| Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172015000400004 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|