Journal of Algorithms and Computation
Open Access

Skolem Odd Difference Mean Graphs

Document Type : Research Paper

Authors

P. Jeyanthi 1
D. Ramya 2
R. Kalaiyarasi 2

1 Principal and Head of the Research Centre,Department of Mathematics,Govindammal Aditanar College for Women,Tiruchendur,Tamilnadu,INDIA

2 Department of Mathematics, Dr.Sivanthi Aditanar College of Engineering, Tiruchendur- 628 215, India.

https://doi.org/10.22059/jac.2014.7916
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.

Keywords

mean labeling
skolem difference mean labeling
skolem odd difference mean labeling
skolem odd difference mean graph
skolem even vertex odd difference mean labeling

Home

Guide for Authors

Submit Manuscript

Reviewers

Contact Us