TY - JOUR
ID - 7916
TI - Skolem Odd Difference Mean Graphs
JO - Journal of Algorithms and Computation
JA - JAC
LA - en
SN - 2476-2776
AU - Jeyanthi, P.
AU - Ramya, D.
AU - Kalaiyarasi, R.
AD - Principal and Head of the Research Centre,Department of Mathematics,Govindammal Aditanar College for Women,Tiruchendur,Tamilnadu,INDIA
AD - Department of Mathematics, Dr.Sivanthi Aditanar College of Engineering, Tiruchendur- 628 215, India.
Y1 - 2014
PY - 2014
VL - 45
IS - 1
SP - 1
EP - 12
KW - mean labeling
KW - skolem difference mean labeling
KW - skolem odd difference mean labeling
KW - skolem odd difference mean graph
KW - skolem even vertex odd difference mean labeling
DO - 10.22059/jac.2014.7916
N2 - 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.
UR - https://jac.ut.ac.ir/article_7916.html
L1 - https://jac.ut.ac.ir/article_7916_727d297ed723f77921f5f0cb0b62cd65.pdf
ER -