Show simple item record

dc.creatorSugumaran, A.
dc.creatorRajesh, K.
dc.date2019-10-02
dc.date.accessioned2019-11-14T12:01:22Z
dc.date.available2019-11-14T12:01:22Z
dc.identifierhttps://www.revistaproyecciones.cl/article/view/3779
dc.identifier10.22199/issn.0717-6279-2019-04-0042
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/113710
dc.descriptionA sum divisor cordial labeling of a graph G with vertex set V (G) is a bijection f : V (G) → {1, 2, ..., |V (G)|} such that an edge uv assigned the label 1 if 2 divides f(u)+f(v) and 0 otherwise. Further the number of edges labeled with 0 and the the number of edges labeled with 1 differ by atmost 1. A graph with sum divisor cordial labeling is called a sum divisor cordial graph. In this paper we prove that the graphs Pn + Pn (n is odd), Pn@K1,m, Cn@K1,m (n is odd), Wn ∗ K1,m (n is even), < K₁¹,n,n ∆K₁²,n,n >, < Fln¹∆Fln² > are sum divisor cordial graphs.en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad Católica del Norte.es-ES
dc.relationhttps://www.revistaproyecciones.cl/article/view/3779/3239
dc.rightsDerechos de autor 2019 A. Sugumaran, K. Rajeshes-ES
dc.rightshttps://creativecommons.org/licenses/by/4.0es-ES
dc.sourceProyecciones. Journal of Mathematics; Vol 38 No 4 (2019); 653-663en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 38 Núm. 4 (2019); 653-663es-ES
dc.source0717-6279
dc.source0716-0917
dc.subjectDivisor cordial labelingen-US
dc.subjectSum divisor cordial labelingen-US
dc.subject05C78en-US
dc.subjectGraph labelling (graceful graphs, bandwidth, etc.)en-US
dc.titleExtended results on sum divisor cordial labelingen-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typeArtículo revisado por pareses-ES
dc.typetexten-US


This item appears in the following Collection(s)

Show simple item record