Further results on 3-product cordial labeling
Abstract 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 ed...
Guardado en:
| Autores principales: | , , |
|---|---|
| Lenguaje: | English |
| Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2019
|
| Materias: | |
| Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172019000200191 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| id |
oai:scielo:S0716-09172019000200191 |
|---|---|
| record_format |
dspace |
| spelling |
oai:scielo:S0716-091720190002001912019-05-30Further results on 3-product cordial labelingJeyanthi,P.Maheswari,A.Vijayalakshmi,M. Cordial labeling Product cordial labeling 3-product cordial labeling 3-product cordial graph. Abstract 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.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.38 n.2 20192019-06-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172019000200191en10.4067/S0716-09172019000200191 |
| institution |
Scielo Chile |
| collection |
Scielo Chile |
| language |
English |
| topic |
Cordial labeling Product cordial labeling 3-product cordial labeling 3-product cordial graph. |
| spellingShingle |
Cordial labeling Product cordial labeling 3-product cordial labeling 3-product cordial graph. Jeyanthi,P. Maheswari,A. Vijayalakshmi,M. Further results on 3-product cordial labeling |
| description |
Abstract 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. |
| author |
Jeyanthi,P. Maheswari,A. Vijayalakshmi,M. |
| author_facet |
Jeyanthi,P. Maheswari,A. Vijayalakshmi,M. |
| author_sort |
Jeyanthi,P. |
| title |
Further results on 3-product cordial labeling |
| title_short |
Further results on 3-product cordial labeling |
| title_full |
Further results on 3-product cordial labeling |
| title_fullStr |
Further results on 3-product cordial labeling |
| title_full_unstemmed |
Further results on 3-product cordial labeling |
| title_sort |
further results on 3-product cordial labeling |
| publisher |
Universidad Católica del Norte, Departamento de Matemáticas |
| publishDate |
2019 |
| url |
http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172019000200191 |
| work_keys_str_mv |
AT jeyanthip furtherresultson3productcordiallabeling AT maheswaria furtherresultson3productcordiallabeling AT vijayalakshmim furtherresultson3productcordiallabeling |
| _version_ |
1718439846499844096 |