Show simple item record

dc.creatorLourdusamy, A.
dc.creatorPatrick, F.
dc.date2017-03-23
dc.date.accessioned2019-11-14T11:59:10Z
dc.date.available2019-11-14T11:59:10Z
dc.identifierhttps://www.revistaproyecciones.cl/article/view/1238
dc.identifier10.4067/S0716-09172016000100008
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/113029
dc.descriptionA 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.formatapplication/pdf
dc.languagespa
dc.publisherUniversidad Católica del Norte.es-ES
dc.relationhttps://www.revistaproyecciones.cl/article/view/1238/951
dc.rightsDerechos de autor 2016 Proyecciones. Journal of Mathematicses-ES
dc.sourceProyecciones. Journal of Mathematics; Vol 35 No 1 (2016); 119-136en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 35 Núm. 1 (2016); 119-136es-ES
dc.source0717-6279
dc.source0716-0917
dc.subjectSum divisor cordiales-ES
dc.subjectdivisor cordiales-ES
dc.subjectdivisor cordial de suma.es-ES
dc.titleSum divisor cordial graphses-ES
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typeArtículo revisado por pareses-ES


This item appears in the following Collection(s)

Show simple item record