dc.creator | Jeyanthi, P. | |
dc.creator | Kalaiyarasi, R. | |
dc.creator | Ramya, D. | |
dc.creator | Devi, T. Saratha | |
dc.date | 2017-03-23 | |
dc.identifier | http://www.revistaproyecciones.cl/article/view/1318 | |
dc.identifier | 10.4067/S0716-09172016000400004 | |
dc.description | Let G = (V, E) be a graph with p vertices and q edges. A graph G is said to be skolem odd difference mean if there exists a function f : V(G) → {0, 1, 2, 3,...,p+3q — 3} satisfying f is 1-1 and the induced map f * : E(G) →{1, 3, 5,..., 2q-1} defined by f * (e) = [(f(u)-f(v))/2] is a bijection. A graph that admits skolem odd difference mean labeling is called skolem odd difference mean graph. We call a skolem odd difference mean labeling as skolem even vertex odd difference mean labeling if all vertex labels are even. A graph that admits skolem even vertex odd difference mean labeling is called skolem even vertex odd difference mean graph.In this paper we prove that graphs B(m,n) : Pw, (PmõSn), mPn, mPn U tPs and mK 1,n U tK1,s admit skolem odd difference mean labeling. If G(p, q) is a skolem odd differences mean graph then p≥ q. Also, we prove that wheel, umbrella, Bn and Ln are not skolem odd difference mean graph. | es-ES |
dc.format | application/pdf | |
dc.language | spa | |
dc.publisher | Universidad Católica del Norte. | es-ES |
dc.relation | http://www.revistaproyecciones.cl/article/view/1318/1030 | |
dc.rights | Derechos de autor 2016 Proyecciones. Journal of Mathematics | es-ES |
dc.rights | https://creativecommons.org/licenses/by-nc/4.0/ | es-ES |
dc.source | Proyecciones. Journal of Mathematics; Vol 35 No 4 (2016); 405-415 | en-US |
dc.source | Proyecciones. Revista de Matemática; Vol. 35 Núm. 4 (2016); 405-415 | es-ES |
dc.source | 0717-6279 | |
dc.source | 0716-0917 | |
dc.title | Some results on skolem odd difference mean labeling | 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 |