| dc.creator | Selvi, M. | |
| dc.creator | Ramya, D. | |
| dc.creator | Jeyanthi, P. | |
| dc.date | 2015-09-01 | |
| dc.date.accessioned | 2019-11-14T11:59:11Z | |
| dc.date.available | 2019-11-14T11:59:11Z | |
| dc.identifier | https://www.revistaproyecciones.cl/article/view/1250 | |
| dc.identifier | 10.4067/S0716-09172015000300004 | |
| dc.identifier.uri | https://revistaschilenas.uchile.cl/handle/2250/113041 | |
| dc.description | A graph G = (V, E) with p vertices and q edges is said to haveskolem difference mean labeling if it is possible to label the verticesx ∈ V with distinct elements f(x) from 1, 2, 3, · · · , p+q in such a waythat for each edge e = uv, let f ∗(e) = l|f(u)− 2 f(v)|m and the resultinglabels of the edges are distinct and are from 1, 2, 3, · · · , q. A graphthat admits a skolem difference mean labeling is called a skolem difference mean graph. In this paper, we prove Cn@Pm(n ≥ 3, m ≥ 1),T hK1,n1 : K1,n2 : · · · : K1,nmi, T hK1,n1 ◦ K1,n2 ◦ ◦ ◦ K1,nmi,St(n1, n2, · · · , nm) and Bt(n, n, · · · , n| {z }m times) are skolem difference mean graphs. | es-ES |
| dc.format | application/pdf | |
| dc.language | spa | |
| dc.publisher | Universidad Católica del Norte. | es-ES |
| dc.relation | https://www.revistaproyecciones.cl/article/view/1250/963 | |
| dc.rights | Derechos de autor 2015 Proyecciones. Journal of Mathematics | es-ES |
| dc.source | Proyecciones. Journal of Mathematics; Vol 34 No 3 (2015); 243-254 | en-US |
| dc.source | Proyecciones. Revista de Matemática; Vol. 34 Núm. 3 (2015); 243-254 | es-ES |
| dc.source | 0717-6279 | |
| dc.source | 0716-0917 | |
| dc.subject | Mean labeling | es-ES |
| dc.subject | Skolem difference mean labeling | es-ES |
| dc.subject | Skolem difference mean graph | es-ES |
| dc.subject | Extra skolem difference mean labeling. | es-ES |
| dc.title | Skolem Difference Mean Graphs | es-ES |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
| dc.type | Artículo revisado por pares | es-ES |
