dc.creator | Jeyanthi, P. | |
dc.creator | Maheswari, A. | |
dc.creator | Vijayalakshmi, M. | |
dc.date | 2019-05-06 | |
dc.date.accessioned | 2019-06-28T17:07:08Z | |
dc.date.available | 2019-06-28T17:07:08Z | |
dc.identifier | http://www.revistaproyecciones.cl/article/view/3523 | |
dc.identifier.uri | https://revistaschilenas.uchile.cl/handle/2250/101162 | |
dc.description | A 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.format | application/pdf | |
dc.language | eng | |
dc.publisher | Universidad Católica del Norte. | es-ES |
dc.relation | http://www.revistaproyecciones.cl/article/view/3523/3153 | |
dc.rights | Derechos de autor 2019 Proyecciones. Revista de Matemática | es-ES |
dc.rights | http://creativecommons.org/licenses/by-nc-nd/4.0/ | es-ES |
dc.source | Proyecciones. Journal of Mathematics; Vol 38 No 2 (2019); 191-202 | en-US |
dc.source | Proyecciones. Revista de Matemática; Vol. 38 Núm. 2 (2019); 191-202 | es-ES |
dc.source | 0717-6279 | |
dc.source | 0716-0917 | |
dc.title | Further results on 3-product cordial labeling. | en-US |
dc.type | info:eu-repo/semantics/article | |
dc.type | info:eu-repo/semantics/publishedVersion | |
dc.type | Artículo revisado por pares | es-ES |
dc.type | texto | es-ES |
dc.type | text | en-US |