| dc.creator | Selvi, M. | es |
| dc.creator | Ramya, D. | es |
| dc.creator | Jeyanthi, P. | es |
| dc.date | 2025-04-17 | |
| dc.date.accessioned | 2025-10-06T15:04:54Z | |
| dc.date.available | 2025-10-06T15:04:54Z | |
| dc.identifier | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1250 | |
| dc.identifier | 10.4067/S0716-09172015000300004 | |
| dc.identifier.uri | https://revistaschilenas.uchile.cl/handle/2250/255420 | |
| 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 |
| dc.format | application/pdf | |
| dc.language | spa | |
| dc.publisher | Universidad Católica del Norte. | en |
| dc.relation | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1250/963 | |
| dc.rights | Copyright (c) 2015 Proyecciones. Journal of Mathematics | en |
| dc.rights | https://creativecommons.org/licenses/by/4.0 | en |
| dc.source | Proyecciones (Antofagasta); Vol. 34 No. 3 (2015); 243-254 | en |
| dc.source | Proyecciones. Revista de Matemática; Vol. 34 Núm. 3 (2015); 243-254 | es |
| dc.source | 0717-6279 | |
| dc.source | 10.22199/issn.0717-6279-2015 | |
| dc.title | Skolem Difference Mean Graphs | es |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
