Some results on skolem odd difference mean labeling

• Jeyanthi, P. ^[1] ; Kalaiyarasi, R. ^[2] ; Ramya, D. ^[3] ; Devi, T. Saratha ^[4]
  1. [1] Govindammal Aditanar College for Women.
  2. [2] Dr. Sivanthi Aditanar College of Engineering.
  3. [3] Government Arts College for Women.
  4. [4] G. Venkataswamy Naidu College.

  Mostrar afiliaciones +
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 35, Nº. 4, 2016, págs. 405-415
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • 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.