Show simple item record

dc.creatorJeyanthi, P.
dc.creatorMaheswari, A.
dc.creatorVijayalakshmi, M.
dc.date2019-05-06
dc.date.accessioned2019-06-28T17:07:08Z
dc.date.available2019-06-28T17:07:08Z
dc.identifierhttp://www.revistaproyecciones.cl/article/view/3523
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/101162
dc.descriptionA mapping f : V (G) → {0, 1, 2} is called 3-product cordial labeling if |vf(i) − vf(j)| ≤ 1 and |ef(i) − ef(j)| ≤ 1 for any i, j ∈ {0, 1, 2}, where vf(i) denotes the number of vertices labeled with i, ef(i) denotes the number of edges xy with f(x)f(y) ≡ i(mod 3). A graph with 3-product cordial labeing is called 3-product cordial graph. In this paper we establish that switching of an apex vertex in closed helm, double fan, book graph K1,n × K2 and permutation graph P (K2 + mK1, I) are 3-product cordial graphs.en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad Católica del Norte.es-ES
dc.relationhttp://www.revistaproyecciones.cl/article/view/3523/3153
dc.rightsDerechos de autor 2019 Proyecciones. Revista de Matemáticaes-ES
dc.rightshttp://creativecommons.org/licenses/by-nc-nd/4.0/es-ES
dc.sourceProyecciones. Journal of Mathematics; Vol 38 No 2 (2019); 191-202en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 38 Núm. 2 (2019); 191-202es-ES
dc.source0717-6279
dc.source0716-0917
dc.titleFurther results on 3-product cordial labeling.en-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typeArtículo revisado por pareses-ES
dc.typetextoes-ES
dc.typetexten-US


This item appears in the following Collection(s)

Show simple item record