Show simple item record

dc.creatorLourdusamy, A.
dc.creatorPatrick, F.
dc.date2017-12-01
dc.date.accessioned2019-11-14T12:00:33Z
dc.date.available2019-11-14T12:00:33Z
dc.identifierhttps://www.revistaproyecciones.cl/article/view/2538
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/113426
dc.descriptionGiven a bijection ʄ : V(G) → {1,2, …,|V(G)|}, we associate 2 integers S = ʄ(u)+ʄ(v) and D = |ʄ(u)-ʄ(v)| with every edge uv in E(G). The labeling ʄ induces an edge labeling ʄ' : E(G) → {0,1} such that for any edge uv in E(G), ʄ '(uv)=1 if gcd(S,D)=1, and ʄ ' (uv)=0 otherwise. Let eʄ ' (i) be the number of edges labeled with i ∈ {0,1}. We say ʄ is SD-prime cordial labeling if |eʄ '(0)-e ʄ' (1)| ≤ 1. Moreover G is SD-prime cordial if it admits SD-prime cordial labeling. In this paper, we investigate the SD-prime cordial labeling of some derived graphs.en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad Católica del Norte.es-ES
dc.relationhttps://www.revistaproyecciones.cl/article/view/2538/2140
dc.rightsDerechos de autor 2017 Proyecciones. Journal of Mathematicses-ES
dc.rightshttps://creativecommons.org/licenses/by-nc/4.0/es-ES
dc.sourceProyecciones. Journal of Mathematics; Vol 36 No 4 (2017); 601-614en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 36 Núm. 4 (2017); 601-614es-ES
dc.source0717-6279
dc.source0716-0917
dc.subjectSD-prime labelingen-US
dc.subjectSD-prime cordial labelingen-US
dc.subjectStaren-US
dc.titleSome results on SD-Prime cordial labeling.en-US
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