@article {
author = {Jeyanthi, P. and Ramya, D. and Kalaiyarasi, R.},
title = {Skolem Odd Difference Mean Graphs},
journal = {Journal of Algorithms and Computation},
volume = {45},
number = {1},
pages = {1-12},
year = {2014},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {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},
url = {https://jac.ut.ac.ir/article_7916.html},
eprint = {https://jac.ut.ac.ir/article_7916_727d297ed723f77921f5f0cb0b62cd65.pdf}
}