University of TehranJournal of Algorithms and Computation2476-277645120141115Skolem Odd Difference Mean Graphs112791610.22059/jac.2014.7916ENP.JeyanthiPrincipal and Head of the Research Centre,Department of Mathematics,Govindammal Aditanar College for Women,Tiruchendur,Tamilnadu,INDIAD.RamyaDepartment of Mathematics, Dr.Sivanthi Aditanar College of Engineering, Tiruchendur- 628 215, India.R.KalaiyarasiDepartment of Mathematics, Dr.Sivanthi Aditanar College of Engineering, Tiruchendur- 628 215, India.Journal Article20140726In 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.https://jac.ut.ac.ir/article_7916_727d297ed723f77921f5f0cb0b62cd65.pdf