ViraScience.
Article

Skolem Odd Difference Mean Graphs

D. Ramya, P. Jeyanthi, R. Kalaiyarasi

Abstract

In this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. Let G = (V,E) be a graph with p vertices and q edges. G is said 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} denoted by f*(e) =|f(u)−f(v)|/2 is a bijection. A graph that admits skolem odd difference mean labeling is called odd difference mean graph. We call skolem odd difference mean labeling as skolem even vertex odd difference mean labeling if all the vertex labels are even.

Similar items

  • skolem odd difference mean graphs

    Articlejournal of algorithms and computationp. jeyanthi, principal and head of the research centre,department of mathematics,govindammal aditanar college for women,tiruchendur,tamilnadu,india d. ramya, department of mathematics, dr.sivanthi aditanar college of engineering, tiruchendur- 628 215, india. r. kalaiyarasi, department of mathematics, dr.sivanthi aditanar college of engineering, tiruchendur- 628 215, india.

    in this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. let g = (v,e) be a graph with p vertices and q edges. g is said be skolem odd difference mean if there exists a function f : v

  • Some results on skolem odd difference mean labeling

    Open-access article2016Proyecciones (Antofagasta)PJeyanthi, RKalaiyarasi, DRamya, TSaratha Devi

  • On Skolem odd and even difference mean graphs

    Open-access article2018Journal of King Saud University - ScienceGee-ChoonLau, P.Jeyanthi, D.Ramya, R.Kalaiyarasi

  • Skolem Difference Mean Graphs

    Open-access article2012Mapana - Journal of SciencesKMurugan, ASubramanian

  • Restricted triangular difference mean graphs

    Open-access article2020Proyecciones (Antofagasta)P.Jeyanthi, M.Selvi, D.Ramya

  • Skolem difference mean labeling of disconnected graphs

    Scholarly record2017P. Jeyanthi

    Let G = (V,E) be a graph with p vertices and q edges. G is said to have skolem difference mean labeling if it is possible to label the vertices x ∈ V with distinct elements f(x) from 1, 2, 3, ..., p+ q in such a way that for each edge e = uv, let f∗(e) = l |f(u)−f(v)| 2 m and the