TY - JOUR
ID - 7942
TI - Further results on odd mean labeling of some subdivision graphs
JO - Journal of Algorithms and Computation
JA - JAC
LA - en
SN - 2476-2776
AU - Vasuki, R.
AU - Suganthi, S.
AU - Pooranam, G.
AD - Department of Mathematics, Dr. Sivanthi Aditanar College of Engineering, Tiruchendur-628 215, Tamil Nadu, India
Y1 - 2016
PY - 2016
VL - 48
IS - 1
SP - 81
EP - 98
KW - labeling
KW - odd mean labeling
KW - odd mean graph
DO - 10.22059/jac.2016.7942
N2 - Let G(V,E) be a graph with p vertices and q edges. A graph G is said to have an odd mean labeling if there exists a function f : V (G) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : E(G) → {1, 3, 5,...,2q - 1} defined by
f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd
is a bijection. A graph that admits an odd mean labeling is called an odd mean graph. In this paper, we have studied an odd meanness property of the subdivision of the slanting ladder SLn for all n ≥ 2; Cn Θ K1 for n ≥ 3; the grid Pm × Pn for m, n ≥ 2; Cm@Cn for m, n ≥ 3 and P2m Θ nK1 for all m, n ≥ 1..
UR - https://jac.ut.ac.ir/article_7942.html
L1 - https://jac.ut.ac.ir/article_7942_b5919c4f284019e6cc358136ade4b8ed.pdf
ER -