| dc.creator | Lourdusamy, A. | |
| dc.creator | Patrick, F. | |
| dc.date | 2017-03-23 | |
| dc.identifier | http://www.revistaproyecciones.cl/article/view/1238 | |
| dc.identifier | 10.4067/S0716-09172016000100008 | |
| dc.description | A sum divisor cordial labeling of a graph G with vertex set V is a bijection f from V (G) to {1, 2, ..., |V (G)|} such that an edge uv is assigned the label 1 if 2 divides f (u) + f (v) and 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph with a sum divisor cordial labeling is called a sum divisor cordial graph. In this paper, we prove that path, comb, star, complete bipartite, K2+ mK1, bistar, jewel, crown, flower, gear, subdivision of the star, K1,3* K1,n and square graph of Bn,n are sum divisor cordial graphs. | 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/1238/951 | |
| dc.rights | Derechos de autor 2016 Proyecciones. Journal of Mathematics | es-ES |
| dc.source | Proyecciones. Journal of Mathematics; Vol 35 No 1 (2016); 119-136 | en-US |
| dc.source | Proyecciones. Revista de Matemática; Vol. 35 Núm. 1 (2016); 119-136 | es-ES |
| dc.source | 0717-6279 | |
| dc.source | 0716-0917 | |
| dc.title | Sum divisor cordial 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 |
